Arithmetic coding for data compression
Explore this paper's citation graph
Summary
The state of the art in data compression is arithmetic coding, not the better-known Huffman method, which gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.
- Type
- article
- Published
- 1987-06-01
- Cited by
- 3,543
- References
- 20
- Access
- Open access
- OpenAlex
- https://openalex.org/W2129652681
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3343393
Keywords
Huffman coding, Arithmetic coding, Context-adaptive binary arithmetic coding, Tunstall coding, Data compression
References
- Source coding algorithms for fast data compression
- Data compression techniques and applications
- A Technique for High-Performance Data Compression
- A method for the construction of minimum-redundancy codes
- Algorithms for Adaptive Huffman Codes
- Variations on a theme by Huffman
- The mathematical theory of communication
- Generalized Kraft Inequality and Arithmetic Coding
- Self-organizing linear search
- Optimizing Preventive Service of Software Products
- Universal modeling and coding
- Compression of individual sequences via variable-rate coding
- International digital facsimile coding standards
- Arithmetic stream coding using fixed precision registers
- Data Compression Using Adaptive Coding and Partial String Matching
- Compression of Black-White Images with Arithmetic Coding
- A comparison of enumerative and adaptive codes
- Data compression: Techniques and applications : hardware and software considerations
- An Introduction to Arithmetic Coding
- Arithmetic Coding
Cited by
- Arithmetic Coding of Weighted Finite Automata
- Content-based image indexing and retrieval for visual information systems
- Compression adaptative de surfaces par ondelettes géométriques.
- Improving the Effective Query Process for XML Data by Arithmetic Encoding
- Video coding for compression and content-based functionality
- Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
- Compressed Abstract Syntax Trees for Mobile Code
- Entropy Growth in the Early Universe, and the Search for Determining if Gravity is Classical or Quantum, Part I (Confirmation of Initial Big Bang Conditions?)
- ISSDC: Digram Coding Based Lossless Data Compression Algorithm
- A Practical Transmission System Based on the Human Visual Model for Satellite Channels
- Compression and streaming of polygon meshes
- Universal Image Compression Using Multiscale Recurrent Patterns With Adaptive Probability Model
- Database Compression: A Performance Enhancement Tool
- Compression of 3D models with NURBS
- S-EMG signal compression based on domain transformation and spectral shape dynamic bit allocation
- Audio Compression: Discussion of an Alternative Approach
- n-Gram-Based Text Compression
- Visually imperceptible image hiding scheme based on VQ
- Multi-Class Source-Channel Coding
- Lossless wavelet based image compression with adaptive 2D decomposition
Related papers
- Variants of Golomb Coding and the n-ary Versions
- Dimensional adaptive arithmetic coding for image compression
- Distributed conditional arithmetic coding based on adaptive source-symbol purging
- The ELS-coder: a rapid entropy coder
- Code compression using variable-to-fixed coding based on arithmetic coding
- CMedia Compressor: An Application to Graphically Compare General Compression Algorithms and Adaptive Huffman Compression Algorithm
- Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
- Compression of VLSI test data by arithmetic coding