Bounds on the redundancy of Huffman codes (Corresp.)
- 1 November 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (6), 854-857
- https://doi.org/10.1109/tit.1986.1057239
Abstract
New upper bounds on the redundancy of Huffman codes are provided. A bound that for2/9 leq P_{1} leq 0.4is sharper than the bound of Gallager, when the probability of the most likely source letterP_{1}is the only known probability is presented. The improved bound is the tightest possible for1/3 leq P_{1} leq 0.4. Upper bounds are presented on the redundancy of Huffman codes when the extreme probabilitiesP_{1}andP_{N}are known.Keywords
This publication has 5 references indexed in Scilit:
- On the redundancy of binary Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1980
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- An improved bound for weight-balanced treeInformation and Control, 1977
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948