Arithmetic coding for data compression

Арифметическое кодирование для сжатия данных
Ian H. Witten, Radford M. Neal, John G. Cleary
1987-06-01
SCID:  54.1/383mz4rf Discuss with AI
Huffman codingadaptive modelsarithmetic codingchannel encodingdata compression
Abstract (AI)
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 Findings
1
Arithmetic coding achieves greater compression than Huffman coding.
2
Arithmetic coding clearly separates the statistical model from channel encoding.
3
Arithmetic coding is faster when used with adaptive models.
4
Arithmetic coding represents the state of the art in data compression, outperforming the better-known Huffman method.
Research Object

arithmetic coding for data compression

Research Subject

compression performance, speed for adaptive models, and separation of the statistical model from channel encoding

Publication Details
Publication Date
1987-06-01
Journal
Publisher
ISSN
Access Type
Author Information
Authors
Ian H. Witten
Radford M. Neal
John G. Cleary
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat →
Make a presentation
100%