Simulation of random processes and rate-distortion theory

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 63-86

  Steinberg, Yossef ^b   Verdú, Sergio ^a,c  

^a IEEE

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c Princeton University   (United States)

Author keywords

Data compression; Divergence; Ornstein distance; Prohorov distance; Rate distortion theory; Resolvability; Shannon theory; Simulation complexity; Variational distance

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMPRESSION; ERRORS; INFORMATION THEORY; SIGNAL DISTORTION;

APPROXIMATION ERRORS; BINARY ENTROPY FUNCTION; FINITE ALPHABET PROCESS; FINITE PRECISION RESOLVABILITY; ORNSTEIN DISTANCE; PROHOROV DISTANCE; RATE DISTORTION THEORY; RESOLVABILITY; SHANNON THEORY; VARIATIONAL DISTANCE;

RANDOM PROCESSES;

EID: 0029734858     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481779     Document Type: Article

References (18)

1. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inform. Theory, vol. 39, pp. 752-772, May 1993.
2. Y. Steinberg and S. Verdi "Channel simulation and coding with side information," IEEE Trans. Inform. Theory, vol. 40, no. 3, pp. 634-646, May 1994.
3. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
4. R. M. Gray and L. D. Davisson, "Source coding theorems without the ergodic assumption," IEEE Trans. Inform. Theory, vol. IT-20, no. 4, pp. 502-516, July 1974.
5. J. C. Kieffer, "On the optimum average distortion attainable by fixed-rate coding of a nonergodic source," IEEE Trans. Inform. Theory, vol. IT-21, no. 2, pp. 190-193, Mar. 1975.
6. _, "Strong converses in source coding relative to a fidelity criterion," IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 257-262, Mar. 1991.
7. P. C. Shields, D. L. Neuhoff, L. D. Davisson, and F. Ledrappier, "The distortion-rate function for nonergodic sources," Ann. Prob., vol. 6, no. 1, pp. 138-143, 1978.
8. Y. V. Prohorov, "Convergence of random processes and limit theorems in probability theory," Theor. Probability Appl., vol. 1, pp. 157-214, 1956.
9. V. Strassen, "The existence of probability measures with given marginals," Ann. Math. Statist., vol. 36, pp. 423-439, 1965.
10. R. M. Gray, D. L. Neuhoff, and P. C. Shields, "A generalization of Ornstein's d̄ distance with applications to information theory," Ann. Prob., vol. 3, no. 2, pp. 315-328, 1975.
11. I. Vajda, Theory of Statistical Inference and Information. Norwell, MA: Kluwer, 1989.
12. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
13. D. S. Ornstein, "An application of ergodic theory to probability theory," Ann. Prob., vol 1, pp. 43-58, 1973.
14. P. Papantoni-Kazakos and R. M. Gray, "Robustness of estimators on stationary observations," Ann. Prob., vol. 7, pp. 989-1002, 1979.
15. F. R. Hampel, "A general qualitative definition of robustness," Ann. Math. Statist., vol. 42, pp. 1887-1896, 1971.
16. R. M. Gray and D. S. Ornstein, "Block coding for discrete stationary d̄-continuous noisy channels," IEEE Trans. Inform. Theory, vol. IT-25, no 3, pp. 292-306, May 1979.
17. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
18. D. E. Knuth and A. C. Yao, "The complexity of random number generation," in Proc. Symp. on New Directions and Recent Results in Algorithms and Complexity. New York: Academic Press, 1976.