An empirical evaluation of coding methods for multi-symbol alphabets☆
References (42)
- et al.
Algorithms for adaptive Huffman codes
Information Processing Letters
(1984) - et al.
Analysis of arithmetic coding for data compression
Information Processing & Management
(1992) Dynamic Huffman coding
Journal of Algorithms
(1985)- et al.
Text Compression
(January 1990) - et al.
Data compression in full-text retrieval systems
Journal of the American Society for Information Science
(October 1993) - et al.
A locally adaptive data compression scheme
Communications of the ACM
(April 1986) - et al.
Is Huffman coding dead?
- et al.
A systematic approach to compressing a full-text retrieval system
Information Processing & Management
(1992) - et al.
High efficiency, multiplication free approximation of arithmetic coding
- et al.
A comparison of enumerative and adaptive codes
IEEE Transactions on Information Theory
(March 1984)
Data compression using adaptive coding and partial string matching
IEEE Transactions on Communications
(April 1984)
A Huffman-Shannon-Fano code
Proc. IEEE
(July 1973)
Universal codeword sets and representations of the integers
IEEE Transactions on Information Theory
(March 1975)
An adaptive system for data compression
A new data structure for cumulative probability tables
Software—Practice and Experience
(March 1994)
Data compression with finite windows
Communications of the ACM
(April 1989)
Variations on a theme by Huffman
IEEE Transactions on Information Theory
(November 1978)
Practical dictionary/arithmetic data compression synthesis
National Institute of Standards. Special Publication 500-207
Efficient decoding of prefix codes
Communications of the ACM
(April 1990)
Constructing word-based text compression algorithms
Cited by (0)
- ☆
A preliminary presentation of this work was made at the 1993 IEEE Data Compression Conference.
Copyright © 1994 Published by Elsevier Ltd.