A Double-Adaptive File Compression Algorithm
Glen G. Langdon, J. Rissanen · IRE Transactions on Communications Systems · 1983
We describe a one-pass compression scheme which presumes no statistical properties of the data being compressed. The model structure adaptively selects a subset of first-order Markov contexts, based on an estimate of the candidate context's popularity. The probability distributions for the unselected (lumped) first-order contexts are made the same, reducing cost over a full first-order Markov model. Symbol repetitions are handled in special secondorder Markov contexts. The statistics for each symbol are adaptively determined by an extension of earlier work.
Cited by 30 works. doi:10.1109/tcom.1983.1095765
Authors
References
- A Mathematical Theory of Communication
- Compression of individual sequences via variable-rate coding
- The art of computer programming. Vol.1: Fundamental algorithms
- Universal modeling and coding
- Compression of Black-White Images with Arithmetic Coding
- A simple general binary source code (Corresp.)
- A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
- Analysis of a Mobile Radio Communication System with Two Types of Customers and Priority