DocumentCode
1205949
Title
The length of a typical Huffman codeword
Author
Schack, Riidiger
Author_Institution
Dept. of Phys. & Astron., New Mexico Univ., Albuquerque, NM, USA
Volume
40
Issue
4
fYear
1994
fDate
7/1/1994 12:00:00 AM
Firstpage
1246
Lastpage
1247
Abstract
If pi(i=1,···, N) is the probability of the ith letter of a memoryless source, the length li of the corresponding binary Huffman codeword can be very different from the value -log pi. For a typical letter, however, li≈-logpi. More precisely, Pm -=Σ/sub j∈{i|l<-logpj-m}/pj<2-m and Pm +=Σ/sub j∈{i|li>-logpi+m/}pj<2-c(m-2)+2, where c≈2.27
Keywords
Huffman codes; binary sequences; probability; binary Huffman codeword; ith letter; length; memoryless source; probability; typical Huffman codeword; Astronomy; Binary trees; Information theory; Joining processes; Physics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.335944
Filename
335944
Link To Document