Arithmetic Coding
The paper discusses a dual family of so-called ``arithmetic codes for data compression and develops a decodability theory for them. These codes are best viewed as multiple radix representations of sequences as numbers: either greater or smaller than one. These codes collapses to ordinary ``concatenation codes when the radices are picked in a special way. The outstanding feature of arithmetic codes is that they never require alphabet extension, which is an expensive device even in simple applications and impossible to use in complex ones. With arithmetic codes coding for data compression purposes is done in the same general manner as transforming, say, integers in decimal notation to their binary representation; i.e., by adding to the previous code a suitable product of the radices for each symbol to be encoded. Because the numbers involved are generally huge special attention must be paid to how to perform the basic arithmetic operations in normal size registers. The paper discusses how this can be done using certain length parameters as the basic design parameters, these being approximates of the logarithms of the radices.
- Lossless image compression based on multiple-tables arithmetic coding
- Hierarchy representations based on arithmetic coding for dynamic information protection systems
- Worst-case analysis of the iterated longest fragment algorithm
- Comments on ``Arithmetic coding as a non-linear dynamical system
- Time-universal data compression
- Asymptotically most powerful tests for random number generators
- Large-scale network motif analysis using compression
- Image compression with anisotropic diffusion
- On the estimation of independent binomial random variables using occurrence and sequential information
- A novel block-based scheme for arithmetic coding
- One-time pad as a nonlinear dynamical system
- Good codes based on very sparse matrices
- Textual data compression in computational biology: algorithmic techniques
- Many-Layered Learning
- On undetected redundancy in the Burrows-Wheeler transform
- A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes
- An Introduction to Neural Data Compression
- Is Huffmann coding dead?
- You could have invented Fenwick trees
- Joint compression and encryption using chaotically mutated Huffman trees
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- Effective entropies and data compression
- Text compression methods
- Assembling approximately optimal binary search trees efficiently using arithmetics
This page was built for publication: Arithmetic Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190552)