Housekeeping for prefix coding
- 1 April 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 48 (4) , 622-628
- https://doi.org/10.1109/26.843129
Abstract
—We consider the problem of constructing and transmitting the prelude for Huffman coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when , the size of the source alphabet, is of the same magnitude as , the length of the message being coded. The proposed structures are of direct relevance in applications that mimic one-pass operation through the use of semistatic compression on a block-by-block basis. Index Terms—Adaptive coding, canonical code, Huffman code,Keywords
This publication has 14 references indexed in Scilit:
- On the implementation of minimum redundancy prefix codesIEEE Transactions on Communications, 1997
- Overview of the Second Text Retrieval Conference (TREC-2)Information Processing & Management, 1995
- A fast and space-economical algorithm for length-limited codingPublished by Springer Nature ,1995
- An empirical evaluation of coding methods for multi-symbol alphabetsInformation Processing & Management, 1994
- Is Huffman coding dead?Computing, 1993
- A fast algorithm for optimal length-limited Huffman codesJournal of the ACM, 1990
- 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
- Run-length encodings (Corresp.)IEEE Transactions on Information Theory, 1966
- Generating a canonical prefix encodingCommunications of the ACM, 1964