Complexity of Strings in the Class of Markov Sources

IEEE Transactions on Information Theory

Volumn 32, Issue 4, 1986, Pages 526-532

  Rissanen, Jorma ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES - ALGORITHMS;

FINITE-STATE MACHINE (FSM) DEFINED SOURCES; MARKOV SOURCES; NOISELESS CODING THEOREM; SHANNON'S STRING SELF-INFORMATION; STRINGS COMPLEXITY;

AUTOMATA THEORY;

EID: 0022754340     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057210     Document Type: Article

References (20)

1. G. J. Chaitin, “On the lengths of programs for computing finite binary sequences,” J. Ass. Comput. Mach., vol. 13, pp. 547–569, 1966.
2. L. D. Davisson, “The prediction error of stationary Gaussian time series of unknown covariance,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 527–532, 1965.
3. L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783–795, 1973.
4. L. D. Davisson, “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 211–215, 1983.
5. L. D. Davisson, R. J. McEliece, M. B. Pursley, and M. S. Wallace, “Efficient universal noiseless source codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 269–279, 1981.
6. P. Elias, “Universal codeword sets and representations of the integers,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 194–203, 1975.
7. D. Kazakos, “Robust noiseless source coding through game theoretic approach,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 576–583, 1983.
8. A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” Probl. Inform. Transmis., vol. 1, pp. 4–7, 1965.
9. R. E. Krichevskii and V. K. Trofimov, “The performance of universal encoding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 199–207, 1983.
10. A. Lempel and J. Ziv, “On the complexity of finite sequences,” IEEE Trans. Inform. Theory vol. IT-22, pp. 75–81, 1974.
11. R. J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
12. J. Rissanen and G. G. Langdon, Jr., “Universal modeling and coding,” IEEE Trans. Inform. Theory., vol. IT-27, pp. 12–23, 1981.
13. J. Rissanen, “A universal prior for integers and estimation by minimum description length,” Ann. Statist. vol. 11, pp. 416–431, 1983.
14. J. Rissanen, “A universal data compression system,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 656–664, 1983.
15. J. Rissanen, “Universal coding, information, prediction, and estimation,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 629–636, 1984.
16. J. Rissanen, “Stochastic complexity and modeling,” Ann. Statist., September 1986.
17. R. J. Solomonoff, “A formal theory of inductive inference, Parts I and II,” Inform. Contr., vol. 7, pp. 1–22, 224–254, 1964.
18. J. M. Starkov, “Coding of discrete sources with unknown statistics,” presented at Colloquia Math. Soc. Janos Bolyai, 16, Topics in Information Theory, Keszthely, Hungary, 1975.
19. D. W. Stroock, An Introduction to the Theory of Large Deviations. New York: Springer-Verlag, 1984.
20. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate encoding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530–536, 1978.