✦ 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
DOI: 10.1109/tit.1976.1055554

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

Maximal codeword lengths in Huffman codes

✍ 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,