Complexity distortion theory

IEEE Transactions on Information Theory

Volumn 49, Issue 3, 2003, Pages 604-608

  Sow, Daby M ^a   Eleftheriadis, Alexandros ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Columbia University ^*  (United States)

Author keywords

Kolmogorov complexity; Markov types; Rate distortion function; Universal coding

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); MARKOV PROCESSES; PROBABILITY; TURING MACHINES;

COMPLEXITY DISTORTION THEORY; KOLMOGOROV COMPLEXITY; RATE DISTORTION THEORY; UNIVERSAL CODING;

COMPUTATIONAL COMPLEXITY;

EID: 0037354226     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.808135     Document Type: Article

References (21)

1. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
3. M. Davis, Computability and Unsolvability. New York: Dover, 1982.
4. E. Scheirer, "Structured audio, Kolmogorov complexity, and generalized audio coding," IEEE Trans. Speech Audio Processing, vol. 9, pp. 914-931, Aug. 2001.
5. R. M. Gray, D. L. Neuhoff, and D. S. Ornstein, "Non-block source coding with a fidelity criterion," Ann. Probab., vol. 3, pp. 478-491, 1975.
6. R. C. Jeffrey, "Mises redux," in Basic Problems in Methodology and Linguistics, R. Butts and J. Hintikka, Eds. Dordrecht, The Netherlands: Reidel, 1977, pp. 213-222.
7. J. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, Mar. 1991.
8. A. N. Kolmogorov, "Three approaches to the quantitative definition of information," Probl. Inform. Transm., vol. 1, no. 1, pp. 1-7, 1965.
9. S. K. Leung-Yan-Cheong and T. M. Cover, "Some equivalence between Shannon entropy and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. IT-24, pp. 331-339, May 1978.
10. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, 2nd ed. New York: Springer-Verlag, 1997.
11. J. Muramatsu and F. Kanaya, "Distortion-complexity and rate-distortion function," IEICE Trans. Fundamentals, vol. E77-A, pp. 1224-1229, 1994.
12. J. Rissanen, Stochastic Complexity in Statistical Inquiry. Singapore: World Scientific, 1989.
13. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, 1948.
14. P. C. Shields, "Universal almost sure data compression using Markov types," Probl. Contr. Inform. Theory, vol. 19, pp. 269-277, 1990.
15. D. Sow and A. Eleftheriadis, "Complexity distortion theory," in Proc. IEEE Int. Symp. Information Theory, Ulm, Germany, June/July 1997, p. 188.
16. ____, "Approximation of the resource bounded complexity distortion function," in Proc. 2000 IEEE Int. Symp. Information Theory, Sorrento, Italy, 2000, p. 206.
17. P. Vitanyi and M. Li, "Minimum description length induction, Bayesianism and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. 46, pp. 446-464, Mar. 2000.
18. W. Wulf, M. Shaw, and P. N. Hilfinger, Fundamental Structures of Computer Science. Reading, MA: Addison-Wesley, 1981.
19. E. H. Yang, "The proof of Levin's conjecture," Chinese Sci. Bull., vol. 34, pp. 1761-1765, 1989.
20. E. H. Yang and S. Shen, "Distortion program-size complexity with respect to a fidelity criterion and rate distortion function," IEEE Trans. Inform. Theory, vol. 39, pp. 288-292, Jan. 1993.
21. A. K. Zvonkin and L. A. Levin, "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms," Russian Math. Surv., vol. 25, no. 6, pp. 83-124, 1970.