✦ LIBER ✦

Huffman coding with an infinite alphabet

✍ Scribed by Kato, A.; Te Sun Han; Nagaoka, H.

Book ID: 114540369
Publisher: IEEE
Year: 1996
Tongue: English
Weight: 718 KB
Volume: 42
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.490559

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alphabet Partitioning Techniques for Sem

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 31 KB

Alphabet Partitioning Techniques for Sem

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

✍ Chen, D.; Yi-Jen Chiang; Memon, N.; Xiaolin Wu 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 604 KB

Coding on Countably Infinite Alphabets

✍ Boucheron, S.; Garivier, A.; Gassiat, E. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 363 KB

Minimal distance lexicographic codes ove

Minimal distance lexicographic codes over an infinite alphabet

✍ Herscovici, D.S. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 282 KB

An efficient chain code with Huffman cod

An efficient chain code with Huffman coding

✍ Yong Kui Liu; Borut Žalik 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Huffman-type codes for infinite source d

Huffman-type codes for infinite source distributions

✍ Julia Abrahams 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 418 KB

A new s@cient condition is given for an infinite source distribution to share a minimum average codeword length code with the geometric distribution. Thus, some new examples of parametric ,families of infinite source distributions can be optimally encoded by Huffman-type codes.