✦ LIBER ✦

Algorithms for adaptive Huffman codes

✍ Scribed by Gordon V. Cormack; R.Nigel Horspool

Book ID: 113162652
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 609 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90021-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast-adaptive Huffman coding algorithm

✍ Lu, W.-W.; Gough, M.P. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 312 KB

Two Algorithms for Constructing Efficien

Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes

✍ Lin, C.-W.; Wu, J.-L.; Chuang, Y.-J. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 30 KB

Two algorithms for constructing efficien

Two algorithms for constructing efficient huffman-code based reversible variable length codes

✍ Chia-Wei Lin; Ja-Ling Wu; Yuh-Jue Chuang 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 345 KB

Adaptive combined Chase-GMD algorithms f

Adaptive combined Chase-GMD algorithms for block codes

✍ Mahran, A.; Benaissa, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 122 KB

Adaptive Huffman coding of 2-D DCT coeff

Adaptive Huffman coding of 2-D DCT coefficients for image sequence compression

✍ Jechang Jeong; Jae Moon Jo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 990 KB

An efficient decoding technique for Huff

An efficient decoding technique for Huffman codes

✍ Rezaul Alam Chowdhury; M. Kaykobad; Irwin King 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of s