Level-compressed Huffman decoding

Kuo Liang Chung, Jung Gen Wu

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.

Original languageEnglish
Pages (from-to)1455-1457
Number of pages3
JournalIEEE Transactions on Communications
Issue number10
Publication statusPublished - 1999
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Level-compressed Huffman decoding'. Together they form a unique fingerprint.

Cite this