DocumentCode
771873
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
Volume
48
Issue
7
fYear
2002
fDate
7/1/2002 12:00:00 AM
Firstpage
2132
Lastpage
2138
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2002.1013158
Filename
1013158
Link To Document