On the Role of Common Codewords in Quadratic Gaussian Multiple Descriptions Coding
Kumar Viswanatha, Emrah Akyol, Kenneth Rose

TL;DR
This paper demonstrates that the Combinatorial Message Sharing (CMS) scheme outperforms the Venkataramani-Kramer-Goyal (VKG) scheme in the quadratic Gaussian multiple descriptions problem for all channels with three or more descriptions, extending the achievable region.
Contribution
It proves that CMS strictly extends VKG for the L-channel quadratic Gaussian MD problem, even when 2-description regions coincide, and achieves the complete rate-distortion region in new asymmetric scenarios.
Findings
CMS outperforms VKG for L≥3 channels.
CMS achieves the complete rate-distortion region in certain asymmetric cases.
CMS strictly extends the VKG region despite EC region completeness for 2-descriptions.
Abstract
This paper focuses on the problem of channel quadratic Gaussian multiple description (MD) coding. We recently introduced a new encoding scheme in [1] for general channel MD problem, based on a technique called `Combinatorial Message Sharing' (CMS), where every subset of the descriptions shares a distinct common message. The new achievable region subsumes the most well known region for the general problem, due to Venkataramani, Kramer and Goyal (VKG) [2]. Moreover, we showed in [3] that the new scheme provides a strict improvement of the achievable region for any source and distortion measures for which some 2-description subset is such that the Zhang and Berger (ZB) scheme achieves points outside the El-Gamal and Cover (EC) region. In this paper, we show a more surprising result: CMS outperforms VKG for a general class of sources and distortion measures, which includes scenarios…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Error Correcting Code Techniques · Algorithms and Data Compression
