Universal data compression and repetition times
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (1) , 54-58
- https://doi.org/10.1109/18.42176
Abstract
A novel universal data compression algorithm is described. This algorithm encodes L source symbols at a time. An upper limit for the number of bits per source symbol is given for the class of binary stationary sources. In the author's analysis, a property of repetition times turns out to be of crucial importanceKeywords
This publication has 8 references indexed in Scilit:
- Interval and recency rank source coding: Two on-line adaptive variable-length schemesIEEE Transactions on Information Theory, 1987
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- On the notion of recurrence in discrete stochastic processesBulletin of the American Mathematical Society, 1947