Is Huffman coding dead?
- 1 December 1993
- journal article
- Published by Springer Nature in Computing
- Vol. 50 (4) , 279-296
- https://doi.org/10.1007/bf02243872
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- A fast algorithm for optimal length-limited Huffman codesJournal of the ACM, 1990
- Bidirectional Huffman CodingThe Computer Journal, 1990
- Bounds on the redundancy of Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1986
- Dynamic huffman codingJournal of Algorithms, 1985
- Self-synchronizing Huffman codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Huffman coding in bit-vector compressionInformation Processing Letters, 1978
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Codes based on inaccurate source probabilitiesIEEE Transactions on Information Theory, 1971