Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- 1 November 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (6), 1250-1258
- https://doi.org/10.1109/18.45281
Abstract
Theorems concerning the entropy of a stationary ergodic information source are derived and used to obtain insight into the workings of certain data-compression coding schemes, in particular the Lempel-Siv data compression algorithm.<>Keywords
This publication has 7 references indexed in Scilit:
- Universal data compression and repetition timesIEEE Transactions on Information Theory, 1989
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Correction Notes: Correction to "The Individual Ergodic Theorem of Information Theory"The Annals of Mathematical Statistics, 1960
- The Individual Ergodic Theorem of Information TheoryThe Annals of Mathematical Statistics, 1957
- On the notion of recurrence in discrete stochastic processesBulletin of the American Mathematical Society, 1947