On the implementation of minimum redundancy prefix codes
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 45 (10) , 1200-1207
- https://doi.org/10.1109/26.634683
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Arithmetic coding revisitedPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adding compression to a full‐text retrieval systemSoftware: Practice and Experience, 1995
- Overview of the Second Text Retrieval Conference (TREC-2)Information Processing & Management, 1995
- Efficient decoding of compressed dataJournal of the American Society for Information Science, 1995
- Memory efficient and high-speed search Huffman codingIEEE Transactions on Communications, 1995
- Efficient decoding of prefix codesCommunications of the ACM, 1990
- Fast decoding of the Huffman codesInformation Processing Letters, 1988
- Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)IEEE Transactions on Information Theory, 1987
- Efficient variants of Huffman codes in high level languagesPublished by Association for Computing Machinery (ACM) ,1985
- A Huffman-Shannon-Fano codeProceedings of the IEEE, 1973