On the Multiple Description Coding Problem with One Semi-Deterministic Distortion Measure

In this paper, we revisit the multiple description coding problem with one semi-deterministic distortion measure, which we term as the Fu- Yeung problem (Fu and Yeung, 2002). We present the properties of optimal test channels for the minimum sum-rate function, a non- asymptotic converse bound and second-order asymptotics for discrete memoryless sources. Since the successive refinement problem is a special case of the Fu-Yeung problem, as a by-product, we obtain a non-asymptotic converse bound for the successive refinement problem, which turns out to be a strict generalization of the non-asymptotic converse bound for successively refinable sources (Zhou, Tan and Motani, 2017).

[1]  Tsachy Weissman,et al.  Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff , 2015, IEEE Transactions on Information Theory.

[2]  Sergio Verdú,et al.  A new converse in rate-distortion theory , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[3]  Ram Zarnir.  Gaussian Codes and Shannon Bounds for Multiple Descriptions , 1998 .

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

[5]  Mehul Motani,et al.  Discrete Lossy Gray–Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations , 2015, IEEE Transactions on Information Theory.

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

[7]  H. S. Witsenhausen,et al.  B.S.T.J. brief: On source networks with minimal breakdown degradation , 1980, The Bell System Technical Journal.

[8]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[9]  Amiram H. Kaspi,et al.  Rate-distortion function when side-information may be present at the decoder , 1994, IEEE Trans. Inf. Theory.

[10]  Shun Watanabe,et al.  Second-Order Region for Gray–Wyner Network , 2015, IEEE Transactions on Information Theory.

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

[12]  Yuval Kochman,et al.  The Dispersion of Lossy Source Coding , 2011, 2011 Data Compression Conference.

[13]  Bixio Rimoldi,et al.  Successive refinement of information: characterization of the achievable rates , 1994, IEEE Trans. Inf. Theory.

[14]  Amin Gohari,et al.  A technique for deriving one-shot achievability results in network information theory , 2013, 2013 IEEE International Symposium on Information Theory.

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

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

[17]  Ertem Tuncel,et al.  The rate-distortion function for successive refinement of abstract sources , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[18]  Mehul Motani,et al.  Second-order coding region for the discrete lossy Gray-Wyner source coding problem , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[20]  Kenneth Rose,et al.  Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions , 2015, IEEE Transactions on Information Theory.

[21]  Mehul Motani,et al.  Second-order coding region for the discrete successive refinement source coding problem , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[22]  Sergio Verdú,et al.  Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.

[23]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[24]  R. Yeung,et al.  On the rate-distortion region for multiple descriptions , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[25]  A. Wyner,et al.  Source coding for multiple descriptions , 1980, The Bell System Technical Journal.

[26]  Kenneth Rose,et al.  Computation and analysis of the N-Layer scalable rate-distortion function , 2003, IEEE Trans. Inf. Theory.

[27]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[28]  Aaron D. Wyner,et al.  On source coding with side information at the decoder , 1975, IEEE Trans. Inf. Theory.

[29]  Mehul Motani,et al.  Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems , 2017, ArXiv.

[30]  Robert M. Gray,et al.  Source coding for a simple network , 1974 .

[31]  Mehul Motani,et al.  Kaspi Problem Revisited: Non-Asymptotic Converse Bound and Second-Order Asymptotics , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

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

[33]  Vincent Yan Fu Tan,et al.  Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities , 2014, Found. Trends Commun. Inf. Theory.

[34]  Toby Berger,et al.  Failure of successive refinement for symmetric Gaussian mixtures , 1997, IEEE Trans. Inf. Theory.

[35]  Mehul Motani,et al.  Second-Order and Moderate Deviations Asymptotics for Successive Refinement , 2016, IEEE Transactions on Information Theory.

[36]  Vincent Yan Fu Tan,et al.  Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.

[37]  Rudolf Ahlswede,et al.  On multiple descriptions and team guessing , 1986, IEEE Trans. Inf. Theory.