A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints

We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the erasure distortion measure or Hamming distortion measure, this lower bound can be evaluated with the aid of certain minimax theorems. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.

[1]  Chao Tian,et al.  Broadcasting Correlated Vector Gaussians , 2015, IEEE Transactions on Information Theory.

[2]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem , 2005, IEEE Transactions on Information Theory.

[3]  L. Ozarow,et al.  On a source-coding problem with two channels and three receivers , 1980, The Bell System Technical Journal.

[4]  S. Kakutani.  A generalization of Brouwer’s fixed point theorem , 1941 .

[5]  Ebad Ahmed,et al.  Erasure Multiple Descriptions , 2012, IEEE Transactions on Information Theory.

[6]  Tie Liu,et al.  An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems , 2006, IEEE Transactions on Information Theory.

[7]  Jun Chen,et al.  Rate Region of Gaussian Multiple Description Coding With Individual and Central Distortion Constraints , 2009, IEEE Transactions on Information Theory.

[8]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[9]  Vivek K. Goyal,et al.  Multiple description coding with many channels , 2003, IEEE Trans. Inf. Theory.

[10]  Chandra Nair,et al.  Upper concave envelopes and auxiliary random variables , 2013 .

[11]  Abbas El Gamal,et al.  Achievable rates for multiple descriptions , 1982, IEEE Trans. Inf. Theory.

[12]  Rudolf Ahlswede,et al.  The rate-distortion region for multiple descriptions without excess rate , 1985, IEEE Trans. Inf. Theory.

[13]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[14]  Fang-Wei Fu,et al.  On the rate-distortion region for multiple descriptions , 2002, IEEE Trans. Inf. Theory.

[15]  Venkat Anantharam,et al.  An improved outer bound for multiterminal source coding , 2008, IEEE Transactions on Information Theory.

[16]  Suhas N. Diggavi,et al.  Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints , 2009, IEEE Transactions on Information Theory.

[17]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[18]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes , 2004, IEEE Transactions on Information Theory.

[19]  Kannan Ramchandran,et al.  n-channel symmetric multiple descriptions-part II:An achievable rate-distortion region , 2005, IEEE Transactions on Information Theory.

[20]  Toby Berger,et al.  Multiple description source coding with no excess marginal rate , 1995, IEEE Trans. Inf. Theory.

[21]  Hua Wang,et al.  Vector Gaussian Multiple Description With Individual and Central Receivers , 2005, IEEE Transactions on Information Theory.

[22]  Meir Feder,et al.  Distortion Bounds for Broadcasting With Bandwidth Expansion , 2006, IEEE Transactions on Information Theory.

[23]  Toby Berger,et al.  New results in binary multiple descriptions , 1987, IEEE Trans. Inf. Theory.

[24]  Te Sun Han.  Nonnegative Entropy Measures of Multivariate Symmetric Correlations , 1978, Inf. Control..

[25]  Chao Tian,et al.  New Coding Schemes for the Symmetric $K$-Description Problem , 2010, IEEE Transactions on Information Theory.

[26]  Jun Chen,et al.  Vector Gaussian Two-Terminal Source Coding , 2013, IEEE Transactions on Information Theory.

[27]  H. Vincent Poor,et al.  Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders , 2006, IEEE Transactions on Information Theory.

[28]  Jun Chen,et al.  On the Sum Rate of Gaussian Multiterminal Source Coding: New Proofs and Results , 2010, IEEE Transactions on Information Theory.

[29]  Hua Wang,et al.  Vector Gaussian Multiple Description With Two Levels of Receivers , 2006, IEEE Transactions on Information Theory.

[30]  Shunsuke Ihara,et al.  On the Capacity of Channels with Additive Non-Gaussian Noise , 1978, Inf. Control..