Two-way source coding with a helper

Authors:
Haim H. Permuter;Yossef Steinberg;Tsachy Weissman
Affiliations:
Department of Electrical and Computer Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel;Department of Electrical Engineering, Stanford University, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 12
Cited 0

Two-way source coding with a fidelity criterion

IEEE Transactions on Information Theory
Learning in graphical models

Learning in graphical models
Causality: models, reasoning, and inference

Causality: models, reasoning, and inference
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
The Gaussian many-help-one distributed source coding problem

IEEE Transactions on Information Theory
Gaussian multiterminal source coding

IEEE Transactions on Information Theory
Capacity results for the discrete memoryless network

IEEE Transactions on Information Theory
Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder

IEEE Transactions on Information Theory
Two-way successively refined joint source-channel coding

IEEE Transactions on Information Theory
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

IEEE Transactions on Information Theory
Coding for Channels With Rate-Limited Side Information at the Decoder, With Applications

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

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 when the Markov relation (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. We derive these regions explicitly for the Gaussian sources with square error distortion, analyze a tradeoff between the rate from the helper and the rate from the source, and examine a special case where the helper has the freedom to send different messages, at different rates, to the encoder and the decoder. The converse proofs use a technique for verifying Markov relations via undirected graphs.