Leung-Yan-Chrong, S. K. and Cover, T. M. (1978) Some equivalences between Shannon entropy and Kolmogorov complexity. IEEE. Trans. Inform. Theory, IT-24, 331--338. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Algorithmic Complexity and Stochastic Properties of Finite Binary .. - V'Yugin (1999) (2 citations) (Correct)
Some Notes On Rissanen's Stochastic Complexity - Qian, Künsch (1998) (4 citations) (Correct)
Generativity and Systematicity in Neural Network Combinatorial.. - Brousse (1993) (8 citations) (Correct)
It is not enough to assume stationary ergodic sources for.. - Hojo, Ryabko, Suzuki (1998) (Correct)
New Lower Bounds on the Cost of Binary Search Trees - De Prisco, De Santis (Correct)
Kolmogorov Complexity and Hausdorff Dimension - Staiger (1989) (2 citations) (Correct)
Information and Entropy - Schumacher (1993) (Correct)
New Lower Bounds on the Cost of Binary Search Trees - De Prisco, De Santis (1993) (Correct)
New Bounds on the Expected Length of One-to-One Codes - Blundo, De Prisco (Correct)
Performance of Data Compression in terms of Hausdorff Dimension - Hojo, Ryabko, SUZUKI (Correct)
A Quick Glance at Quantum Cryptography - Lomonaco, Jr. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC