๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Huffman codes and self-information

โœ Scribed by Katona, G.; Nemetz, O.


Book ID
114634487
Publisher
IEEE
Year
1976
Tongue
English
Weight
500 KB
Volume
22
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Anti-uniform huffman codes
โœ Mohajer, S.; Kakhbod, A. ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› The Institution of Engineering and Technology ๐ŸŒ English โš– 158 KB
Dynamic huffman coding
โœ Donald E Knuth ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 895 KB
Block huffman coding
โœ M. Abdul Mannan; M. Kaykobad ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 434 KB
Algorithms for adaptive Huffman codes
โœ Gordon V. Cormack; R.Nigel Horspool ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 609 KB
Fast decoding of the Huffman codes
โœ Andrzej Siemiล„ski ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 595 KB
Maximal codeword lengths in Huffman code
โœ Y.S. Abu-Mostafa; R.J. McEliece ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 332 KB

In this paper, we consider the following question about Huffman coding, which is an important technique for compressing data from a discrete source. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be? We show that if p is in the range 0 < p <\_ 1/2,