A universal finite memory source
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (3) , 643-652
- https://doi.org/10.1109/18.382011
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Optimal sequential probability assignment for individual sequencesIEEE Transactions on Information Theory, 1994
- Noise Separation and MDL Modeling of Chaotic ProcessesPublished by Springer Nature ,1994
- Some properties of sequential predictors for binary Markov sourcesIEEE Transactions on Information Theory, 1993
- A sequential algorithm for the universal coding of finite memory sourcesIEEE Transactions on Information Theory, 1992
- Conditional limit theorems under Markov conditioningIEEE Transactions on Information Theory, 1987
- Complexity of strings in the class of Markov sourcesIEEE Transactions on Information Theory, 1986
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- A universal data compression systemIEEE Transactions on Information Theory, 1983
- The performance of universal encodingIEEE Transactions on Information Theory, 1981