Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary · Communications of the ACM · 1987
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.
Cited by 2,877 works. doi:10.1145/214762.214771 Open-access PDF
Authors
References
- A Mathematical Theory of Communication
- A Mathematical Theory of Communication
- A Method for the Construction of Minimum-Redundancy Codes
- Compression of individual sequences via variable-rate coding
- Information Theory and Coding.
- A Technique for High-Performance Data Compression
- Universal modeling and coding
- Generalized Kraft Inequality and Arithmetic Coding
- Data Compression Using Adaptive Coding and Partial String Matching
- Arithmetic Coding