-Channel Symmetric Multiple Descriptions—Part I:

In this two-part paper, we present a new achiev- able rate region for the general -channel symmetric multiple descriptions problem. In Part I, inspired by the concept of maximum-distance separable (MDS) erasure channel codes, we consider a special case of this rate region, where the source is encoded into descriptions each with rate . These descriptions are transmitted over bandwidth constrained and errorless channels. During transmission, a subset of these channels can break down, thus erasing the corresponding descriptions. The decoder is interested in recovering the source with the reception of at least descriptions. Thus, the encoder is allowed to sample only one realization of this breakdown process during the entire transmission. For Gaussian sources, we have the following interesting result: when any descriptions arrive, the achievable distortion exactly matches the optimal distortion-rate performance corresponding to a source rate of bits; with the reception of any de- scriptions, the source reconstruction quality is strictly better, the improvement being nearly linear in the number of descriptions re- ceived.

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

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  Stéphane Boucheron,et al.  About priority encoding transmission , 2000, IEEE Trans. Inf. Theory.

[4]  Michael T. Orchard,et al.  Multiple description image coding for noisy channels by pairing transform coefficients , 1997, Proceedings of First Signal Processing Society Workshop on Multimedia Signal Processing.

[5]  Vivek K Goyal,et al.  Bounds on the achievable region for certain multiple description coding problems , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[6]  Sergio Verdú,et al.  The source-channel separation theorem revisited , 1995, IEEE Trans. Inf. Theory.

[7]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[8]  Madhu Sudan,et al.  Priority encoding transmission , 1996, IEEE Trans. Inf. Theory.

[9]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[10]  Edward C. van der Meulen,et al.  A proof of Marton's coding theorem for the discrete memoryless broadcast channel , 1981, IEEE Trans. Inf. Theory.

[11]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

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

[13]  Robert M. Gray,et al.  Ergodic and information theory , 1977 .

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

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

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

[17]  Vivek K. Goyal,et al.  Multiple description transform coding of images , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

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

[19]  Vinay A. Vaishampayan,et al.  Design of multiple description scalar quantizers , 1993, IEEE Trans. Inf. Theory.

[20]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[21]  R. Gallager Information Theory and Reliable Communication , 1968 .

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

[23]  Douglas Comer,et al.  Internetworking with TCP/IP , 1988 .

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

[25]  William Equitz,et al.  Successive refinement of information , 1991, IEEE Trans. Inf. Theory.

[26]  Kang-Won Lee,et al.  An integrated source transcoding and congestion control paradigm for video streaming in the Internet , 2001, IEEE Trans. Multim..

[27]  Kannan Ramchandran,et al.  n-channel multiple descriptions: theory and constructions , 2002, Proceedings DCC 2002. Data Compression Conference.