Bits in asymptotically optimal lossy source codes are asymptotically Bernoulli

Proceedings - 2009 Data Compression Conference, DCC 2009

Volumn , Issue , 2009, Pages 272-281

  Gray, Robert M ^a   Linder, Tamás ^b  

^a Stanford University   (United States)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; BERNOULLI; BIT STREAM; BLOCK SOURCE CODING; ERGODIC SOURCES; LOSSY SOURCE CODES;

ASYMPTOTIC ANALYSIS; MICROWAVE ANTENNAS;

DATA COMPRESSION;

EID: 67650697689     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2009.21     Document Type: Conference Paper

References (17)

1. T. M. Cover, J. A. Thomas, Elements of Information Theory, Second Edition, Wiley, New York, 2006.
2. R. M. Gray, "Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion," IEEE Trans. on Info. Theory, vol. IT-23, pp. 71-83, Jan. 1977.
3. R. M. Gray, Entropy and Information Theory, Springer-Verlag, New York, 1990. Available at http:ee.stanford.edu/~gray/it.html.
4. R. M. Gray, "Source coding and simulation," 2008 Shannon Lecture, July 2008, Toronto, Canada. Summary to appear in the Information Theory Society Newsletter.
5. R. M. Gray, D. L. Neuhoff and J. K. Omura, "Process definitions of distortion rate functions and source coding theorems," IEEE Trans. on Info. Theory, vol. IT-21, no. 5, pp. 524-532, Sept. 1975.
6. R. M. Gray, D. L. Neuhoff and P. C. Shields, "A generalization of Ornstein's d-bar distance with applications to information theory," Annals of Probability, vol. 3, no. 2, pp. 315-328, April 1975.
7. K. Marton, "On the rate distortion function of stationary sources," Probl. Contr. Inform. Theory, vol. 4, pp. 289-297, 1975.
8. K. Marton, "Bounding d̄ distance by informational divergence: a method to prove measure concentration," Annals of Probability, vol. 24 (1997) pp. 857-866, 1997.
9. N. Merhav and M. J. Weinberger, "On universal simulation of information sources using training data," IEEE Transactions on Information Theory, vol. 50, no. 1), pp. 5-20, 2004.
10. D. Ornstein. An application of ergodic theory to probability theory. Ann. Probab., 1:43-58, 1973.
11. D. Ornstein. Ergodic Theory, Randomness, and Dynamical Systems. Yale University Press, New Haven, 1975.
12. C. E. Shannon, "Coding theorems for a discrete source with a delity criterion," IRE National Convention Record, Part 4, pp. 142-163, 1959.
13. P. C. Shields, The Ergodic Theory of Discrete Sample Paths, AMS Graduate Studies in Mathematics, vol. 13, American Mathematical Society, 1996.
14. P.C. Shields, "The interactions between ergodic theory and information theory," IEEE Transactions on Information Theory, vol. 44, Oct. 1998, pp. 2079-2093.
15. Y. Steinberg and S. Verdú, "Simulation of random processes and rate-distortion theory," IEEE Trans. on Information Theory, V. 42, No. 1, pp. 63-86. Jan. 1996.
16. R. W. Yeung, Information Theory and Network Coding, Springer, 2008 (Section 5.3).
17. G. Zhou and Z. Zhang, "On the redundancy of trellis lossy source coding," IEEE Trans. Inform. Theory, vol. 48, no. 1, pp. 205-218, Jan. 2002.