Strong Converses in Source Coding Relative to a Fidelity Criterion

IEEE Transactions on Information Theory

Volumn 37, Issue 2, 1991, Pages 257-262

  Kieffer, John C ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Block and variable rate source coding; coding theorem; strong converse

Indexed keywords

INFORMATION THEORY; PROBABILITY - RANDOM PROCESSES; SIGNAL DISTORTION;

BLOCK SOURCE CODING; FIDELITY CRITERION; STRONG CONVERSE; VARIABLE RATE SOURCE CODING;

SIGNAL PROCESSING;

EID: 0026121389     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.75240     Document Type: Article

References (6)

1. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
2. A. I. Khinchin, “The entropy concept in probability Usp. Mat. Nauk, vol. 8, pp. 3–20, 1953.
3. J. C. Kieffer, “Block coding for an ergodic source relative to a zero-one valued fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-24, no. 4, pp. 432–438, July 1978.
4. J. C. Kieffer, “Sample converses in source coding theory,” IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 257–262, Mar. 1991.
5. J. Komer, “Coding of an information source having ambiguous alphabet and the entropy of graphs,” Transactions Sixth Prague Conference on Information Theory. Prague, Czechoslovakia: Academia, 1973, pp. 411–425.
6. B. McMillan, “The basic theorems of information theory,” Ann. Math. Stat, vol. 24, pp. 196–219, 1953.