Data structure of Huffman codes and its application to efficient encoding and decoding

Authors:
Hatsukazu Tanaka
Affiliations:
Kobe Univ., Kobe, Japan
Venue:
IEEE Transactions on Information Theory
Year:
1987

Citing 0
Cited 4

Data compression

ACM Computing Surveys (CSUR)
Efficient decoding of prefix codes

Communications of the ACM
A benchmark suite for evaluating configurable computing systems—status, reflections, and future directions

FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
Multi-attribute lexicon generation hyperlinked embedded access structure

IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium

Quantified Score

Hi-index	754.85

Visualization

Abstract

The data structure of Huffman codes and its application to efficient encoding and decoding of Huffman codes are studied in detail. The tree structure is presented by a two-dimensional array which can be applied for the decoding of Huffman codes as a state transition table of the finite-state decoding automaton. Inversion produces a one-dimensional state transition table of the semiautonomous finite-state sequential machine which can be used as a Huffman encoder with a push-down stack. The encoding and decoding procedures are simple and efficient. It is not only possible to implement by simple hardware but is also applicable to software implementation.