Two-way source coding with a common helper

Haim Permuter, Yossef Steinberg, Tsachy Weissman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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 l)-(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.

Original languageEnglish
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Number of pages5
StatePublished - 19 Nov 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: 28 Jun 20093 Jul 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102


Conference2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of


  • Rate-distortion
  • Two-way rate distortion
  • Undirected graphs
  • Verification of markov relations
  • Wyner-ziv source coding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Two-way source coding with a common helper'. Together they form a unique fingerprint.

Cite this