Arithmetic Coding
From MaRDI portal
Publication:4190552
DOI10.1147/rd.232.0149zbMath0404.94005OpenAlexW2911940095WikidataQ56094442 ScholiaQ56094442MaRDI QIDQ4190552
Jorma Rissanen, Glen G. Jun. Langdon
Publication date: 1979
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2820ae82da3196e2782e7547a1d43eb8221b4356
Related Items (24)
Many-Layered Learning ⋮ A novel block-based scheme for arithmetic coding ⋮ On the estimation of independent binomial random variables using occurrence and sequential information ⋮ An Introduction to Neural Data Compression ⋮ Comments on ``Arithmetic coding as a non-linear dynamical system ⋮ Good codes based on very sparse matrices ⋮ One-time pad as a nonlinear dynamical system ⋮ Large-scale network motif analysis using compression ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Hierarchy representations based on arithmetic coding for dynamic information protection systems ⋮ Is Huffmann coding dead? ⋮ Time-universal data compression ⋮ Arithmetic coding as a non-linear dynamical system ⋮ Joint compression and encryption using chaotically mutated Huffman trees ⋮ Assembling approximately optimal binary search trees efficiently using arithmetics ⋮ Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data ⋮ Effective entropies and data compression ⋮ Asymptotically most powerful tests for random number generators ⋮ Image compression with anisotropic diffusion ⋮ Lossless image compression based on multiple-tables arithmetic coding ⋮ A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes ⋮ Text compression methods ⋮ Worst-case analysis of the iterated longest fragment algorithm ⋮ On Undetected Redundancy in the Burrows-Wheeler Transform
This page was built for publication: Arithmetic Coding
