Arithmetic coding for data compression
Ian H. Witten, Radford M. Neal, John G. Cleary
Abstract
Open-access reader
Ian H. Witten, Radford M. Neal, John G. Cleary
Abstract
Open-access reader
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.
OpenAlex reports 2891 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Huffman coding, Arithmetic coding, Context-adaptive binary arithmetic coding, Tunstall coding, Data compression, Variable-length code, Shannon–Fano coding, Arithmetic