A universal algorithm for sequential data compression
- 1 May 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (3) , 337-343
- https://doi.org/10.1109/tit.1977.1055714
Abstract
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.Keywords
This publication has 9 references indexed in Scilit:
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Efficient Generation of Optimal Prefix CodeJournal of the ACM, 1975
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- An algorithm for optimal prefix parsing of a noiseless and memoryless channelIEEE Transactions on Information Theory, 1973
- On variable-length-to-block codingIEEE Transactions on Information Theory, 1972
- Coding of sources with unknown statistics--I: Probability of encoding errorIEEE Transactions on Information Theory, 1972
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)Information and Control, 1971
- Minimum-redundancy coding for the discrete noiseless channelIEEE Transactions on Information Theory, 1961
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952