𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient decoding technique for Huffman codes

✍ Scribed by Rezaul Alam Chowdhury; M. Kaykobad; Irwin King

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
56 KB
Volume
81
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

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 symbols. We decode the text by using the memory efficient data structure proposed by Chen et al.

πŸ“œ SIMILAR VOLUMES

An efficient finite-state machine implem
An efficient finite-state machine implementation of Huffman decoders
✍ Vikram Iyengar; Krishnendu Chakrabarty πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 353 KB

We present an efficient hardware implementation of a Huffman decoding algorithm that is based on the prefix-free property of Huffman codes. The proposed method can be used to reduce tester memory requirements for integrated circuit testing. @

An efficient memory allocation scheme fo
An efficient memory allocation scheme for Huffman coding of multiple sources
✍ Seung Jun Lee; Kyeong Ho Yang; Jun Seok Song; Choong Woong Lee πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 206 KB

In this paper, we propose an efficient memory allocation scheme for memory-constrained Huffman coding of multiple sources, which can be applied to many adaptive variable-length coding systems. The allocation of a given memory is performed in two stages. At the first stage, the iterative bisection al