| Title | The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Guo, Tao, Yeung, Raymond w. |
| Conference Name | 2018 Information Theory and Applications Workshop (ITA) |
| Date Published | feb |
| Keywords | channel coding, closed-form, Closed-form solutions, composability, Decoding, distributed data storage, encoding, explicit coding rate region, Indexes, linear optimization problem, Metrics, network coding, optimisation, Optimization, pubcrawl, rate tuple, Resiliency, robust network communication, source coding, superposition coding, symmetric multilevel diversity coding, uncountably many linear inequalities |
| Abstract | It is well known that 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 L. |
| DOI | 10.1109/ITA.2018.8503190 |
| Citation Key | guo_explicit_2018 |
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding