Near sufficiency of random coding for two descriptions

IEEE Transactions on Information Theory

Volumn 52, Issue 2, 2006, Pages 681-695

  Lastras Montaño, Luis Alfonso ^a   Castelli, Vittorio ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Converses; Dithering; Lossy coding; Multiple descriptions (MD); Random coding; Rate distortion theory; Rate loss; Two descriptions; Universal bounds

Indexed keywords

CORRELATION THEORY; RANDOM PROCESSES; SIGNAL DISTORTION; SIGNAL ENCODING; THEOREM PROVING; VECTORS;

CHANNEL'S RATE; CONVERSES; DITHERING; LOSSY CODING; MULTIPLE DESCRIPTIONS (MD); QUADRATIC DISTORTION MEASURE; RANDOM CODING; RATE DISTORTION THEORY; RATE LOSS; UNIVERSAL BOUNDS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 31744435017     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.862073     Document Type: Article

References (25)

1. C. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
2. C. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE Conv. Rec., vol. 7, 1959, pp. 142-163.
3. D. Slepian and J. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
4. A. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. IT-22, no. 1, pp. 1-10, Jan. 1976.
5. J. Kieffer, "A survey of the theory of source coding with a fidelity criterion," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1473-1490, Sep. 1993.
6. L. Ozarow, "On a source coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, no. 10, pp. 1909-1921, 1980.
7. R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 721-726, Nov. 1985.
8. A. El Gamal and T. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-28, no. 6, pp. 851-857, Nov. 1982.
9. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-33, no. 4, pp. 502-521, Jul. 1987.
10. H. Feng and M. Effros, "On the rate loss of multiple description source codes," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 671-683, Feb. 2005.
11. R. Zamir, "The rate loss in the Wyner-Ziv problem," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 2073-2084, Nov. 1996.
12. L. Lastras and T. Berger, "All sources are nearly successively refinable," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 918-926, Mar. 2001.
13. H. Feng and M. Effros, "Improved bounds for the rate loss of multiresolution source codes," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 809-820, Apr. 2003.
14. L. Lastras-Montaño and V. Castelli, "Near tightness of the El Gamal and Cover region for two descriptions," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2005, pp. 3-12.
15. R. Zamir, "Gaussian codes and Shannon bounds for multiple descriptions," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2629-2636, Nov. 1999.
16. Y. Frank-Dayan and R. Zamir, "Dithered lattice-based quantizers for multiple descriptions," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 192-204, Jan. 2002.
17. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Budapest, Hungary: Akadémiai Kiadó, 1997.
18. H. Feng and M. Effros, "On the achievable region for multiple description source codes on Gaussian sources," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 195.
19. Z. Zhang and T. Berger, "Multiple description source coding with no excess marginal rate," IEEE Trans. Inf. Theory, vol. 41, no. 2, pp. 349-357, Mar. 1995.
20. J. Ziv, "On universal quantization," IEEE Trans. Inf. Theory, vol. IT-31, no. 3, pp. 344-347, May 1985.
21. R. Zamir and M. Feder, "Information rates of pre/post-filtered dithered quantizers," IEEE Trans. Inf. Theory, vol. 42, no. 5, pp. 1340-1353, Sep. 1996.
22. H. Feng, "Rate Loss of Network Source Codes," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, 2002.
23. J. Chen, C. Tian, T. Berger, and S. Hemami, "Multiple description quantization via Gram-Schmidt orthogonalization," IEEE Trans. Inf. Theory, submitted for publication.
24. A. Kashyap, L. A. L.-M. No, C. H. Xia, and Z. Liu, "Distributed source coding in dense sensor networks," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2005, pp. 13-22.
25. S. R. Searle, Matrix Algebra Useful for Statistics. New York: Wiley, 1982, Wiley Series in Probability and Mathematical Statistics.