Inequalities for Shannon Entropy and Kol
β
Daniel Hammer; Andrei Romashchenko; Alexander Shen; Nikolai Vereshchagin
π
Article
π
2000
π
Elsevier Science
π
English
β 272 KB
It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmo