Two-way source coding with a common helper Conference Paper uri icon


  • Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the “further” user, namely, User 2. The converse proofs use a new technique for verifying Markov relations via undirected graphs.

publication date

  • January 1, 2009