𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient chain code with Huffman coding

✍ Scribed by Yong Kui Liu; Borut Žalik

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
139 KB
Volume
38
Category
Article
ISSN
0031-3203

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

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

An efficient heuristic for code partitio
An efficient heuristic for code partitioning
✍ Moez Ayed; Jean-Luc Gaudiot 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 326 KB

In this paper, we propose a heuristic for code partitioning for distributed memory multiprocessors (DMMs). Our method is data-¯ow based where all levels of parallelism can potentially be exploited. Given a weighted directed acyclic graph (DAG) representation of the program, our partitioning algorith