THE LENGTH OF A TYPICAL HUFFMAN CODEWORD

Authors
SCHACK R
Citation
R. Schack, THE LENGTH OF A TYPICAL HUFFMAN CODEWORD, IEEE transactions on information theory, 40(4), 1994, pp. 1246-1247
Citations number
6
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
40
Issue
4
Year of publication
1994
Pages
1246 - 1247
Database
ISI
SICI code
0018-9448(1994)40:4<1246:TLOATH>2.0.ZU;2-S
Abstract
If p(i) (i = 1, ..., N) is the probability of the ith letter of a memo ryless source, the length l(i) of the corresponding binary Huffman cod eword can be very different from the value -log p(i). For a typical le tter, however, l(i) almost-equal-to -log p(i). More precisely, P(m)- = [GRAPHICS] , where c almost-equal-to 2.27.