Title :
A simple upper bound on the redundancy of Huffman codes
Author :
Ye, Chunxuan ; Yeung, Raymond W.
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, China
fDate :
7/1/2002 12:00:00 AM
Abstract :
Upper bounds on the redundancy of Huffman codes have been extensively studied in the literature. Almost all of these bounds are in terms of the probability of either the most likely or the least likely source symbol. We prove a simple upper bound in terms of the probability of any source symbol
Keywords :
Huffman codes; probability; redundancy; Huffman code redundancy; average codeword length; optimal fix-free code; prefix code; probability; source symbol probability; upper bound; Entropy; Probability distribution; Source coding; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.1013158
