Distortion Program-Size Complexity with Respect to a Fidelity Criterion and Rate-Distortion Function

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 288-292

  Yang, En Hui ^a   Shen, Shi Yi ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

Distortion Kolmogorov Chaitin complexity; rate distortion function; universai almost sure data compression

Indexed keywords

DATA COMPRESSION; PROBABILITY; SIGNAL DISTORTION;

DISTORTION KOLMOGOROV-CHAITIN COMPLEXITY; DISTORTION PROGRAM-SIZE COMPLEXITY; FIDELITY CRITERION; RATE-DISTORTION FUNCTION; SHANNON ENTROPY;

INFORMATION THEORY;

EID: 0027311432     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179376     Document Type: Article

References (13)

1. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. A. N. Kolmogorov, “Logical basis for information theory and probability theory,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 662–664, Sept. 1968.
3. J. Ziv, “Distortion-rate theory for individual sequences,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 137–143, Mar. 1980.
4. G. J. Chaitin, “A theory of program size formally identical to information theory,” J. ACM, vol. 22, pp. 329–340, July 1975.
5. S. K. Leung-Yan-Cheong and T. M. Cover, “Some equivalences between Shannon entropy and Kolmogorov complexity,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 331–338, 1978.
6. E. H. Yang, “The proof of Levin's conjecture,” Chinese Sci. Bull., vol. 34, pp. 1761–1765, Nov. 1989.
7. L. K. Zvonkin and L. A. Levin, “Complexity of finite objects and justification of the notion of information and randomness in the framework of the theory of algorithms,” Usp. Mat. Nauk, vol. 25, pp. 85–127, 1970.
8. T. M. Cover, P. Gacs, and R. M. Gray, “Kolmogorov's contributions to information theory and algorithmic complexity,” Ann. Probab., vol. 17, pp. 840-865, 1989.
9. J. C. Kieffer, “Extension of source coding theorems for block codes to sliding-block codes,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 679–692, Nov. 1980.
10. —, “On the minimum rate for strong universal block coding of a class of ergodic sources,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 693–702, Nov. 1980.
11. —, “Sample converses in source coding theory,” IEEE Trans. Inform. Theory, vol. 37, pp. 263–268, Mar. 1991.
12. D. S. Ornstein and P. C. Shields, “Universal almost sure data compression,” Ann. Probab., vol. 18, pp. 441–452, 1990.
13. J.C. Kieffer, “Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source,” IEEE Trans. Inform. Theory, vol. 35, pp. 1259–1263, Nov. 1989.