Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 29-39

  Kieffer, John C ^a,b   Yang, En Hui ^c  

^a IEEE

^b UNIVERSITY OF MINNESOTA   (United States)

^c NANKAI UNIVERSITY   (China)

Author keywords

Individual sequences; Kolmogorov complexity; Lempel Ziv algorithm; Lossless compression; Sequential codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); FINITE AUTOMATA; MATHEMATICAL TRANSFORMATIONS; PROBABILITY;

FINITE ALPHABET; KOLMOGOROV COMPLEXITY; LEMPEL-ZIV ALGORITHM; LOSSLESS COMPRESSION; PROBABILITY MEASURES; SEQUENTIAL CODES;

CODES (SYMBOLS);

EID: 0029754031     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481775     Document Type: Article

References (14)

1. A. Barron, "Logically smooth density estimation," Ph.D. dissertation, Stanford University, Stanford, CA, 1985.
2. Ya. M. Barzdin, "Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set," Sov. Math.-Dokl., vol. 9, pp. 1251-1254, 1968.
3. [31 G. Boolos and R. Jeffrey. Computability and Logic 3rd ed. Cambridge, England: Cambridge Univ. Press, 1989.
4. G. Chaitin, "On the length of programs for computing binary sequences," J. Assoc. Comput. Mach., vol. 13, pp. 547-569, 1966.
5. J. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, 1991.
6. A. Kolmogorov, "Three approaches to the quantitative definition of information," Probl. Inform. Transm., vol. 1, pp. 4-7, 1965.
7. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, 1976.
8. S. Leung-Yan-Cheong and T. Cover, "Some equivalences between Shannon entropy and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. IT-24, pp. 331-338, 1978.
9. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications. New York: Springer-Verlag, 1993.
10. R. Solomonoff, "A formal theory of inductive inference," Inform. Contr., vol. 7. pp. 1-22 and 224-254, 1964.
11. E. Yang and S. Shen, "Chaitin complexity, Shannon information content of a single event and infinite random sequences (I)," Sci. in China, ser. A, vol. 34, pp. 1183-1193, 1991.
12. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
13. _, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.
14. A. Zvonkin and L. Levin, "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms," Russ. Math. Surveys, vol. 25. pp. 83-124, 1970.