An efficient decoding technique for Huffman codes
- 31 March 2002
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 81 (6), 305-308
- https://doi.org/10.1016/s0020-0190(01)00243-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A memory-efficient and fast Huffman decoding algorithmInformation Processing Letters, 1999
- Efficient Huffman decodingInformation Processing Letters, 1997
- Memory efficient and high-speed search Huffman codingIEEE Transactions on Communications, 1995
- The length of a typical Huffman codewordIEEE Transactions on Information Theory, 1994
- Design and analysis of dynamic Huffman codesJournal of the ACM, 1987
- Huffman codes and self-informationIEEE Transactions on Information Theory, 1976
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952