TY - GEN

T1 - Asymmetric multi-level diversity coding

AU - Mohajer, Soheil

AU - Chao, Tian

AU - Diggavi, Suhas N.

PY - 2008/9/1

Y1 - 2008/9/1

N2 - Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1,...,k, where k is the number of encoders to which they have access. In this paper, we formulate an asymmetric multilevel diversity coding problem, where a set of 2K - 1 information sources is encoded by K encoders into K streams/descriptions. There are 2K -1 decoders, each of which has access to a non-empty subset of the encoded messages. The decoders are assigned with ordered levels, and each of them has to decode a subset of the information sources, according to its level, which depends on the set of encoders to which it has access, not just the cardinality. We obtain a single letter characterization of the complete achievable rate region for the 3description problem. In doing so, we show that it is necessary to jointly encode independent sources (i.e., similar to network coding), and that linear codes are optimal for this problem.

AB - Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1,...,k, where k is the number of encoders to which they have access. In this paper, we formulate an asymmetric multilevel diversity coding problem, where a set of 2K - 1 information sources is encoded by K encoders into K streams/descriptions. There are 2K -1 decoders, each of which has access to a non-empty subset of the encoded messages. The decoders are assigned with ordered levels, and each of them has to decode a subset of the information sources, according to its level, which depends on the set of encoders to which it has access, not just the cardinality. We obtain a single letter characterization of the complete achievable rate region for the 3description problem. In doing so, we show that it is necessary to jointly encode independent sources (i.e., similar to network coding), and that linear codes are optimal for this problem.

UR - http://www.scopus.com/inward/record.url?scp=50249174026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249174026&partnerID=8YFLogxK

U2 - 10.1109/DCC.2008.82

DO - 10.1109/DCC.2008.82

M3 - Conference contribution

AN - SCOPUS:50249174026

SN - 0769531210

SN - 9780769531212

T3 - Data Compression Conference Proceedings

SP - 412

EP - 421

BT - Proceedings - 2008 Data Compression Conference, DCC 2008

T2 - 2008 Data Compression Conference, DCC 2008

Y2 - 25 March 2008 through 27 March 2008

ER -