Cooperative Source Coding with Encoder Breakdown

Abstract

DeecI XY x Ri X Ene Dee2-y En~R 2 Fig. 1. Cooperative source coding with encoder breakdownAbstract-This paper provides an inner bound to the ratedistortion 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.

Malleable coding with fixed segment reuse

“…A seemingly related problem of Vasudevan and Perron [10] does not provide too much further insight into the ratemalleability region. Relating their problem statement to our problem statement requires the rate R 1 in our problem to be set to 0 and the decoder for Y to decode both (X,Ŷ ).…”

Problems we can solve with a helper

“…The Gaussian example with helper and without side information Z, was solved in [5]. Their result will be used in the sequel to establish our converse for the Gaussian model.…”

“…Without loss of generality, the encoders can subtract Z from X and Y ; hence the problem is equivalent to new rate distortion problem with a helper, where the source is A and the helper is A + B. Now using the result for the Gaussian case from [5], adapted to our notation, we obtain R ≥ 1 2 log…”

Cascade and Triangular Source Coding With Side Information at the First Two Nodes

“…Of special interest in lossy source coding is the Gaussian case with quadratic distortion, which in many source coding problems is amenable to an analytical solution such as in the Wyner--Ziv problem [12] where side information is available to the decoder, the Heegard--Berger problem [13] where side information at the decoder may be absent, Kaspi's problem [14], [15] where side information is known to the encoder and may or may not be known to the decoder, the multiple description problem [16], [17], the two-way source coding problem [18], the multiterminal problem [19], [20], the CEO problem [21]- [23], rate distortion with a helper [24], [25], and successive refinement [26] and its extension to successive refinement for the Wyner--Ziv problem [27].…”