n-Channel Multiple Descriptions: Theory and Constructions

  • Authors:
  • Rohit Puri;Kannan Ramchandran;S. Sandeep Pradhan

  • Affiliations:
  • -;-;-

  • Venue:
  • DCC '02 Proceedings of the Data Compression Conference
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present new achievable rate regions and code constructions for the symmetric n-channel Multiple Descriptions (MD) coding problem for n2. Our approach is inspired by unexplored connections between MD and the problem of distributed source coding. For illustrative clarity, we restrict our focus to the important special case relating to (n,k) source-channel erasure codes. This involves n encodings of a source with the goal of maximizing its reconstruction fidelity with the availability of any k of them, while strictly improving this reconstruction fidelity with the availability of more than k descriptions. We describe the underlying information-theoretic framework, and then formulate practical constructions based on scalar quantizers and linear channel codes for the n=3 case to illustrate our concepts.