1987Communications of the ACMOpen access

Arithmetic coding for data compression

Ian H. Witten, Radford M. Neal, John G. Cleary

Open full text 2,891 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2891 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Arithmetic coding for data compression — Research Paper | ScholarLens