Name
Abstract | ||
|---|---|---|
Based on the breadth-first search manner and the level-compression technique, this article first presents a new array data structure to represent the classical Huffman (1952) 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 |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/26.795810 | IEEE Transactions on Communications |
Keywords | Field | DocType |
image coding,trees (mathematics),canonical huffman tree,data structures,data compression,image decoding,index terms— data compression,search problems,level-compression technique,huffman tree.,classical huffman tree,decoding algorithm,breadth-first search,array data structure,level-compressed huffman decoding,huffman codes,decoding,decoding time,experiment,memory,indexing terms,frequency,information management,breadth first search,data structure,tree data structures,computer science education | Modified Huffman coding,Data structure,Sequential decoding,Computer science,Algorithm,Huffman coding,Decoding methods,Data compression,List decoding,Canonical Huffman code | Journal |
Volume | Issue | ISSN |
47 | 10 | 0090-6778 |
Citations | PageRank | References |
10 | 0.94 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuo-Liang Chung | 1 | 1166 | 121.24 |
| Jung-Gen Wu | 2 | 39 | 7.28 |