A universal data compression system
J. Rissanen · IEEE Transactions on Information Theory · 1983
A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to describe the source generating parameters.
Cited by 631 works. doi:10.1109/tit.1983.1056741
Authors
References
- Modeling by shortest data description
- Compression of individual sequences via variable-rate coding
- Universal modeling and coding
- On entropy maximization principle
- An algorithm for source coding
- Applications of Statistics.
- Sequence time coding for data compression
- Comments on "Sequence time coading for data compression"
- A simple general binary source code (Corresp.)
- Synthesis of noiseless compression codes