Multiple Description Coding with Many Channels

IEEE Transactions on Information Theory

Volumn 49, Issue 9, 2003, Pages 2106-2114+2326

  Venkataramani, Raman ^a,b   Kramer, Gerhard ^a   Goyal, Vivek K ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b HARVARD UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Multiple descriptions; Rate distortion (RD) theory; Source coding

Indexed keywords

CHANNEL CAPACITY; DECODING; ERROR ANALYSIS; PROBLEM SOLVING;

MULTIPLE DESCRIPTION CODING;

ENCODING (SYMBOLS);

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

References (38)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, July and Oct. 1948. Reprinted in Claude Elwood Shannon: Collected Papers, N. J. A. Sloane and A. D. Wyner, Eds. Piscataway, NJ: IEEE Press, 1993, pp. 5-83.
2. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, July and Oct. 1948. Reprinted in Claude Elwood Shannon: Collected Papers, N. J. A. Sloane and A. D. Wyner, Eds. Piscataway, NJ: IEEE Press, 1993, pp. 5-83.
3. _, "Coding theorems for a discrete source with a fidelity criterion," IRE Int. Com. Rec., pp. 142-163, Mar. 1959. Reprinted in Claude Elwood Shannon: Collected Papers, N. J. A. Sloane and A. D. Wyner, Eds. Piscataway, NJ: IEEE Press, 1993, pp. 325-350.
4. _, "Coding theorems for a discrete source with a fidelity criterion," IRE Int. Com. Rec., pp. 142-163, Mar. 1959. Reprinted in Claude Elwood Shannon: Collected Papers, N. J. A. Sloane and A. D. Wyner, Eds. Piscataway, NJ: IEEE Press, 1993, pp. 325-350.
5. R. M. Gray, "Source coding a symmetric source over a simple network," in Proc. 1973 Hawaii Int. Conf. System Science, Honolulu, HI, Jan. 1973, pp. 354-355.
6. R. M. Gray and A. D. Wyner, "Source-coding for a simple network," Bell Syst. Tech. J., vol. 53, pp. 1681-1721, Nov. 1974.
7. A. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
8. L. Ozarow, "On a source-coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, pp. 1909-1921, Dec. 1980.
9. R. Zamir, "Gaussian codes and Shannon bounds for multiple descriptions," IEEE Trans. Inform. Theory, vol. 45, pp. 2629-2635, Nov. 1999.
10. P. L. Dragotti, S. D. Servetto, and M. Vetterli, "Optimal filter banks for multiple description coding: Analysis and synthesis," IEEE Trans. Inform. Theory, vol. 48, pp. 2036-2052, July 2002.
11. H. S. Witsenhausen, "On source networks with minimal breakdown degradation," Bell Syst. Tech J., vol. 59, pp. 1083-1087, July-Aug. 1980.
12. J. K. Wolf, A. D. Wyner, and J. Ziv, "Source-coding for multiple descriptions," Bell Syst. Tech. J., vol. 59, pp. 1417-1426, Oct. 1980.
13. H. S. Witsenhausen and A. D. Wyner, "On team guessing with independent information," Math. Oper. Res., vol. 6, pp. 293-304, May 1981.
14. H. S. Witsenhausen, "An achievable region for the breakdown degradation problem with multiple channels," Bell Lab. Tech. Memo., TM-81-11217-3, Jan. 1981.
15. T. Berger and Z. Zhang, "Minimum breakdown degradation in binary source coding," IEEE Trans. Inform. Theory, vol. IT-29, pp. 807-814, Nov. 1983.
16. R. Ahlswede, "On multiple descriptions and team guessing," IEEE Trans. Inform. Theory, vol. IT-32, pp. 543-549, July 1986.
17. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-33, pp. 502-521, July 1987.
18. R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE Trans. Inform. Theory, vol. IT-31, pp. 721-726, Nov. 1985.
19. R. Venkataramani, G. Kramer, and V. K. Goyal, "Bounds on the achievable region for certain multiple description coding problems," in Proc. 2001 IEEE Int. Symp. Information Theory, Washington, DC, June 24-29, 2001, p. 148.
20. V. Koshelev, "Multilevel source coding and data-transmission theorem," in Proc. VII All-Union Conf. Theory of Coding and Data Transm., vol. 1, Vilnius, U.S.S.R., 1978, pp. 85-92.
21. _, "Hierarchical coding of discrete sources," Probl. Pered. Inform., vol. 16, no. 3, pp. 31-49, 1980.
22. _, "An evaluation of the average distortion for discrete scheme of sequential approximation," Probl. Pered. Inform., vol. 17, no. 3, pp. 20-33, 1981.
23. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, Mar. 1991.
24. W. H. R. Equitz and T. M. Cover, "Addendum to 'Successive refinement of information'," IEEE Trans. Inform. Theory, vol. 39, pp. 1465-1466, July 1993.
25. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, pp. 253-259, Jan. 1994.
26. F.-W. Fu and R. W. Yeung, "On the rate-distortion region for multiple descriptions," IEEE Trans. Inform. Theory, vol. 48, pp. 2012-2021, July 2002.
27. R. Venkataramani, G. Kramer, and V. K Goyal, "Successive refinement on trees: A special case of a new MD coding region," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2001, pp. 293-301.
28. S. S. Pradhan, R. Puri, and K. Ramchandran, "(n, k) source-channel erasure codes: Can parity bits also refine quality?," in Proc. Conf. Information Sciences and Systems. Baltimore, MD: The Johns Hopkins Univ., 2001.
29. R. Puri, S. S. Pradhan, and K. Ramchandran, "n-channel symmetric multiple descriptions: New rate regions," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June 30-July 5 2002, p. 93.
30. V. A. Vaishampayan, "Design of multiple description scalar quantizers," IEEE Trans. Inform. Theory, vol. 39, pp. 821-834, May 1993.
31. V. K Goyal, "Multiple description coding: Compression meets the network," IEEE Signal Processing Mag., vol. 18, pp. 74-93, Sept. 2001.
32. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
33. A. D. Wyner, "The rate-distortion function for source coding with side information at the decoder-II: General sources," Inform. Contr., vol. 38, pp. 60-80, July 1978.
34. A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. IT-22, pp. 1-10, Jan. 1976.
35. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: The John Hopkins Univ. Press, 1996.
36. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
37. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.
38. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.