# Arithmetic coding

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

- Encyclopedia of Algorithms
- 2008

Arithmetic coding provides an e ective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IEEE Transactions on Signal Processing
- 2007

Although arithmetic coding offers extremely high coding efficiency, it provides little or no security as traditionally… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- IEEE Signal Processing Letters
- 2006

Binary arithmetic coding involves recursive partitioning the range [0,1) in accordance with the relative probabilities of… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

entropy coding, compression, complexity This introduction to arithmetic coding is divided in two parts. The first explains how… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- IEEE Trans. Communications
- 1997

A technique to implement error detection as part of the arithmetic coding process is described. Heuristic arguments are given to… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- IEEE Trans. Signal Processing
- 1993

The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Commun. ACM
- 1987

The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives… (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- IBM Journal of Research and Development
- 1984

Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- IBM Journal of Research and Development
- 1979

• Arithmetic Coding is universal • Arithmetic coding is suitable for small alphabet (binary sources) with highly skewed… (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- IBM Journal of Research and Development
- 1976

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic… (More)

Is this relevant?