Inequalities for Shannon entropy and Kolmogorov complexity

Journal of Computer and System Sciences

Volumn 60, Issue 2, 2000, Pages 442-464

  Hammer, Daniel ^a   Romashchenko, Andrei ^b   Shen, Alexander ^c   Vereshchagin, Nikolai ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION THEORY; THEOREM PROVING;

KOLMOGOROV COMPLEXITY; SHANNON ENTROPY;

COMPUTATIONAL COMPLEXITY;

EID: 0033872924     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1677     Document Type: Article

References (9)

1. Gács P., Körner J. Common information is far less than mutual information. Problems Control Inform. Theory. 2:1973;149-162.
2. Hammer D., Shen A. A strange application of Kolmogorov complexity. Theory Comput. Systems. 31:1998;1-4.
3. Ingleton A. W. Representation of matroids. Welsh D. J. A. Combinatorial Mathematics and Its Applications. 1971;149-167 Academic Press, San Diego.
4. Kolmogorov A. N. Three approaches to the quantitative definition of information. Problems Inform. Transmission. 1:1965;1-7.
5. Kolmogorov A. N. Logical basis for information theory and probability theory. IEEE Trans. Inform. Theory. 14:1968;662-664.
6. Li M., Vitányi P. An Introduction to Kolmogorov Complexity and Its Applications. 1997;Springer-Verlag, Berlin, New York.
7. Uspensky V. A., Shen A. Relation between varieties of Kolmogorov complexities. Math. Systems Theory. 29:1996;271-292.
8. Welsh D. J. A. Matroid Theory. 1976;Academic Press, San Diego.
9. Zvonkin A. K., Levin L. A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys. 25:1970;83-124.