The explicit coding rate region of symmetric multilevel diversity coding
From MaRDI portal
Publication:5211652
DOI10.1109/TIT.2019.2947493zbMATH Open1434.94051arXiv1801.02376OpenAlexW2980804118MaRDI QIDQ5211652FDOQ5211652
Authors: Tao Guo, Raymond W. Yeung 
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: It is well known that {em superposition coding}, namely separately encoding the independent sources, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999). However, the characterization of the coding rate region therein involves uncountably many linear inequalities and the constant term (i.e., the lower bound) in each inequality is given in terms of the solution of a linear optimization problem. Thus this implicit characterization of the coding rate region does not enable the determination of the achievability of a given rate tuple. In this paper, we first obtain closed-form expressions of these uncountably many inequalities. Then we identify a finite subset of inequalities that is sufficient for characterizing the coding rate region. This gives an explicit characterization of the coding rate region. We further show by the symmetry of the problem that only a much smaller subset of this finite set of inequalities needs to be verified in determining the achievability of a given rate tuple. Yet, the cardinality of this smaller set grows at least exponentially fast with . We also present a subset entropy inequality, which together with our explicit characterization of the coding rate region, is sufficient for proving the optimality of superposition coding.
Full work available at URL: https://arxiv.org/abs/1801.02376
Recommendations
Cited In (2)
This page was built for publication: The explicit coding rate region of symmetric multilevel diversity coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211652)
