Source Coding for a Simple Network with Receiver Side Information

TL;DR

This paper studies source coding in a simple network with receiver side information, deriving bounds for the achievable rates and identifying cases where these bounds are tight, extending classic work from 1974.

Contribution

It extends Gray and Wyner's 1974 model by including receiver side information and provides tight bounds for specific cases.

Findings

Inner and outer bounds for the rate region are derived.

Outer bounds are tight for three special cases.

The model generalizes previous source coding frameworks.

Abstract

We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources to two receivers using three noiseless channels: a public channel which connects the transmitter to both receivers, and two private channels which connect the transmitter directly to each receiver. We extend Gray and Wyner's original problem by permitting side information to be present at each receiver. We derive inner and outer bounds for the achievable rate region and, for three special cases, we show that the outer bound is tight.