Kraft-Chaitin inequality revisited

Journal of Universal Computer Science

Volumn 2, Issue 5, 1996, Pages 306-310

  Calude, Cristian ^a   Grozea, Cristian ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Kraft inequality; Kraft Chaitin inequality; Prefix free codes

Indexed keywords

EID: 0000109403     PISSN: 0948695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. J. Berstel, D. Perrin. Theory of Codes, Academic Press, Orlando, 1985.
2. C. Calude. Information and Randomness - An Algorithmic Perspective, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, Berlin, 1994.
3. C. Calude, E. Kurta. On Kraft-Chaitin inequality, Rev. Roumaine Math. Pures Appl. 35 (1990), 597-604.
4. G. J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22(1975), 329-340. (Reprinted in: [6], 197-223.)
5. G. J. Chaitin. Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987. (third printing 1990)
6. G. J. Chaitin. Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987. (2nd ed., 1990)
7. G. J. Chaitin. The Limits of Mathematics, IBM Watson Center, Yorktown Heights, July 17, 1994, 326 pp.
8. D. S. Jones. Elementary Information Theory, Clarendon Press, Oxford, 1979.
9. L. G. Kraft. A Device for Quantizing Grouping and Coding Amplitude Modulated Pulses, MS Thesis, Electrical Eng. Dept., MIT, Cambridge, MA, 1949.