Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

DOI10.1109/TIT.2010.2054535zbMATH Open1366.94306arXiv0911.2346MaRDI QIDQ5281298FDOQ5281298

Authors: S. Mohajer, Chao Tian, Suhas N. Diggavi

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of

2^{K} - 1

information sources, ordered in a decreasing level of importance, is encoded into

K

messages (or descriptions). There are

2^{K} - 1

decoders, each of which has access to a non-empty subset of the encoded messages. Each decoder is required to reproduce the information sources up to a certain importance level depending on the combination of descriptions available to it. We obtain a single letter characterization of the achievable rate region for the 3-description problem. In contrast to symmetric multilevel diversity coding, source-separation coding is not sufficient in the asymmetric case, and ideas akin to network coding need to be used strategically. Based on the intuitions gained in treating the A-MLD problem, we derive inner and outer bounds for the rate region of the asymmetric Gaussian multiple description (MD) problem with three descriptions. Both the inner and outer bounds have a similar geometric structure to the rate region template of the A-MLD coding problem, and moreover, we show that the gap between them is small, which results in an approximate characterization of the asymmetric Gaussian three description rate region.

Full work available at URL: https://arxiv.org/abs/0911.2346

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Cited In (4)

This page was built for publication: Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281298)