Arithmetic Coding
From MaRDI portal
Cited in
(24)- Large-scale network motif analysis using compression
- Good codes based on very sparse matrices
- On undetected redundancy in the Burrows-Wheeler transform
- Is Huffmann coding dead?
- Worst-case analysis of the iterated longest fragment algorithm
- Time-universal data compression
- Assembling approximately optimal binary search trees efficiently using arithmetics
- Joint compression and encryption using chaotically mutated Huffman trees
- A novel block-based scheme for arithmetic coding
- Image compression with anisotropic diffusion
- Many-Layered Learning
- One-time pad as a nonlinear dynamical system
- On the estimation of independent binomial random variables using occurrence and sequential information
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
- Textual data compression in computational biology: algorithmic techniques
- An Introduction to Neural Data Compression
- Effective entropies and data compression
- Comments on ``Arithmetic coding as a non-linear dynamical system
- Asymptotically most powerful tests for random number generators
- A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes
- Hierarchy representations based on arithmetic coding for dynamic information protection systems
- You could have invented Fenwick trees
- Lossless image compression based on multiple-tables arithmetic coding
- Text compression methods
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)
