DocumentCode :
942225
Title :
Bounds on the redundancy of Huffman codes (Corresp.)
Author :
Capocelli, R.M. ; Giancarlo, R. ; Taneja, I.J.
Volume :
32
Issue :
6
fYear :
1986
fDate :
11/1/1986 12:00:00 AM
Firstpage :
854
Lastpage :
857
Abstract :
New upper bounds on the redundancy of Huffman codes are provided. A bound that for 
is sharper than the bound of Gallager, when the probability of the most likely source letter 
is the only known probability is presented. The improved bound is the tightest possible for 
. Upper bounds are presented on the redundancy of Huffman codes when the extreme probabilities and 
are known.
is sharper than the bound of Gallager, when the probability of the most likely source letter is the only known probability is presented. The improved bound is the tightest possible for . Upper bounds are presented on the redundancy of Huffman codes when the extreme probabilities and are known.Keywords :
Huffman coding; Computer science; Computer science education; Entropy; Probability distribution; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1986.1057239
Filename :
1057239
Link To Document :
