✦ LIBER ✦

Fast decoding of the Huffman codes

✍ Scribed by Andrzej Siemiński

Book ID: 113163263
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 595 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90146-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Joint Source-Channel Decoding of Huffman

Joint Source-Channel Decoding of Huffman codes with LDPC codes

✍ Zhonghui Mei; Lenan Wu 📂 Article 📅 2006 🏛 SP Science Press 🌐 English ⚖ 231 KB

Fast decoding of Gabidulin codes

✍ Antonia Wachter-Zeh, Valentin Afanassiev, Vladimir Sidorenko 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 251 KB

A fast algorithm for Huffman decoding ba

A fast algorithm for Huffman decoding based on a recursion Huffman tree

✍ Yih-Kai Lin; Shu-Chien Huang; Cheng-Hsing Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 386 KB

A fast-adaptive Huffman coding algorithm

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

Fast Decodable Turbo Codes

✍ Gazi, O.; Yilmaz, A.O. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 235 KB