Sample Converses in Source Coding Theory

IEEE Transactions on Information Theory

Volumn 37, Issue 2, 1991, Pages 263-268

  Kieffer, John C ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Block and variable rate source coding; mance of codes; sample perfor

Indexed keywords

CODES, SYMBOLIC - ENCODING; INFORMATION THEORY; PROBABILITY; SIGNAL DISTORTION;

BLOCK SOURCE CODING; FIDELITY CRITERION; SAMPLE CONVERSES; SOURCE CODING THEORY; VARIABLE RATE SOURCE CODING;

SIGNAL PROCESSING;

EID: 0026119776     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.75241     Document Type: Article

References (12)

1. P. H. Algoet and T. M. Cover, “A sandwich proof of the Shannon-McMillan-Breiman theorem,” Ann. Prob., vol. 16, pp. 899–909, 1988.
2. A. R. Barron, “Logically smooth density estimation,” Ph.D. thesis, Stanford University, Stanford, CA, 1985.
3. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
4. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
5. 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.
6. J. C. Kieffer, “A unified approach to weak universal source coding,” IEEE Trans. Inform. Theory, vol. IT-24, no. 6, pp. 674–682, Nov. 1978.
7. J. C. Kieffer, “An almost sure convergence theorem for sequences of random variables selected from log-convex sets,” in Proc. Conf. Almost Everywhere Convergence in Probab. Ergodic Theory II, Northwestern Univ., Evanston, IL, 1989.
8. J. Kingman, “The ergodic theory of subadditive stochastic processes,” J. Roy. Stat. Soc., ser. B, vol. 30, pp. 499–510, 1968.
9. K. M. Mackenthun and M. B. Pursley, “Variable-rate, strongly and weakly universal source coding,” in Proc. 1977 Conf. Inform. Sci. Syst., John Hopkins Univ., Mar. 1977, pp. 286–291.
10. D. S. Ornstein and P. C. Shields, “Universal almost sure data compression,” Ann. Prob., vol. 18, pp. 441–452, 1990.
11. H. G. Tucker, A Graduate Course in Probability. New York: Academic, 1967.
12. A. I. Tulcea, “Contributions to information theory for abstract alphabets,” Arkiv för Matematik, vol. 4, pp. 235–247, 1960.