𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some equivalences between Shannon entropy and Kolmogorov complexity

✍ Scribed by Leung-Yan-Cheong, S.; Cover, T.


Book ID
114634734
Publisher
IEEE
Year
1978
Tongue
English
Weight
1011 KB
Volume
24
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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