Universal modeling and coding
Explore this paper's citation graph
Summary
A general class of so-called first-in first-out (FIFO) arithmetic codes is described which require no alphabet extension devices and which therefore can be used in conjunction with the best models.
- Type
- article
- Published
- 1981-01-01
- Cited by
- 528
- References
- 12
- OpenAlex
- https://openalex.org/W2119047110
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:28270470
Keywords
Alphabet, Computer science, Theoretical computer science, Coding (social sciences), Source code
References
- Information theory and coding
- Source coding algorithms for fast data compression
- Three approaches to the quantitative definition of information
- An efficient coding system for long source sequences
- Comments on "Sequence time coading for data compression"
- Enumerative source encoding
- Generalized Kraft Inequality and Arithmetic Coding
- Sequence time coding for data compression
- An algorithm for source coding
- Some equivalences between Shannon entropy and Kolmogorov complexity
- Arithmetic Coding
- Range Encoding: an Algorithm for Removing Redundancy from a Digitised Message
Cited by
- On Arabic Texts Compression and Searching
- Modèles contextuels et alphabets infinis en théorie de l'information
- Wavelet based image compression using FPGAs
- On-line stochastic processes in data compression
- Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine
- Knowledge integration into language models: a random forest approach
- A New Entropy Coding Technique for Data Compression
- Estimation and Inference by Compact Coding
- VLSI implementation of a high speed LZW data compressor
- Universal coding with different modelers in data compression
- Lectures on Statistical Modeling Theory
- Progressiveness and preprocessing in image compression
- Perceptually lossless coding of medical images - from abstraction to reality
- Browsing and searching compressed documents
- Implementing high-order context models for statistical data compression
- Universal homophonic coding
- Adaptive arithmetic data compression: An Implementation suitable for noiseless communication channel use
- The analysis of enumerative source codes and their use in Burrows‑Wheeler compression algorithms
- Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
- An Information-Theoretic Study on Variable-Length Source Coding with Unequal Cost
Related papers
- Error resilient arithmetic coding of still images
- Distributed conditional arithmetic coding based on adaptive source-symbol purging
- Dense coding-a fast alternative to arithmetic coding
- Code compression using variable-to-fixed coding based on arithmetic coding
- Application research of Arithmetic Coding
- A comparative study of context free models of arithmetic coding