Cooperative Source Coding with Encoder Breakdown

This paper provides an inner bound to the rate- distortion region of a source coding setup in which two encoders are allowed some collaboration to describe a pair of discrete memoryless sources. We further require some robustness in case one of the encoders breaks down. This is modeled by having a second decoder, observing the messages from only one of the encoders. We prove the tightness of this inner bound for two special cases. In the first, one of the sources is required to be recovered losslessly if there is no encoder breakdown. In the second, the robustness requirement is dropped and only one of the sources is to be represented. For the second case, we explicitly compute the rate-distortion region for the quadratic Gaussian and binary Hamming problems.

[1]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[2]  Y. Oohama Gaussian multiterminal source coding , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

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

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

[5]  Sui Tung,et al.  Multiterminal source coding (Ph.D. Thesis abstr.) , 1978, IEEE Trans. Inf. Theory.

[6]  Toby Berger,et al.  Multiterminal source encoding with encoder breakdown , 1989, IEEE Trans. Inf. Theory.

[7]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[8]  Toby Berger,et al.  Rate-distortion for correlated sources with partially separated encoders , 1982, IEEE Trans. Inf. Theory.