Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
- 1 January 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (1) , 154-156
- https://doi.org/10.1109/tit.1987.1057265
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.Keywords
This publication has 8 references indexed in Scilit:
- Self-synchronizing Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1984
- An application of informational divergence to Huffman codesIEEE Transactions on Information Theory, 1982
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- A Huffman-Shannon-Fano codeProceedings of the IEEE, 1973
- Generation and enumeration of all solutions of the characteristic sum conditionInformation and Control, 1972
- The number of different possible compact codes (Corresp.)IEEE Transactions on Information Theory, 1967
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948