A Huffman-Shannon-Fano code
- 1 July 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 61 (7) , 1046-1047
- https://doi.org/10.1109/proc.1973.9200
Abstract
A variable-word-length minimum-redundant code is described. It has the advantages of both the Huffman and Shannon-Fano codes in that it reduces transmission time, storage space, translation table space, and encoding and decoding times.Keywords
This publication has 6 references indexed in Scilit:
- Intraframe coding for picture transmissionProceedings of the IEEE, 1972
- An application of cellular logic for high speed decoding of minimum-redundancy codesPublished by Association for Computing Machinery (ACM) ,1972
- Adaptive Variable-Length Coding for Efficient Compression of Spacecraft Television DataIEEE Transactions on Communication Technology, 1971
- Construction of minimum-redundance codes with an optimum synchronizing propertyIEEE Transactions on Information Theory, 1971
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948