Complexity of strings in the class of Markov sources
- 1 July 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (4), 526-532
- https://doi.org/10.1109/tit.1986.1057210
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Stochastic Complexity and ModelingThe Annals of Statistics, 1986
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- An Introduction to the Theory of Large DeviationsPublished by Springer Nature ,1984
- A universal data compression systemIEEE Transactions on Information Theory, 1983
- A Universal Prior for Integers and Estimation by Minimum Description LengthThe Annals of Statistics, 1983
- Minimax noiseless universal coding for Markov sourcesIEEE Transactions on Information Theory, 1983
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- A formal theory of inductive inference. Part IInformation and Control, 1964