Two-way source coding with a common helper

  • Authors:
  • Haim Permuter;Yossef Steinberg;Tsachy Weissman

  • Affiliations:
  • Ben-Gurion University of the Negev;Technion- lIT;Technion/Stanford University

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.