On networks with side information

Authors:
Asaf Cohen;Salman Avestimehr;Michelle Effros
Affiliations:
Department of Electrical Engineering, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering, California Institute of Technology, Pasadena, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 4
Cited 0

Elements of information theory

Elements of information theory
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network coding theory: single sources

Communications and Information Theory
Network information flow

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we generalize the lossless coded side information problem from the three-node network of Ahlswede and Körner to more general network scenarios. We derive inner and outer bounds on the achievable rate region in the general network scenario and show that they are tight for some families of networks. Our approach demonstrates how solutions to canonical source coding problems can be used to derive bounds for more complex networks and reveals an interesting connection between networks with side information, successive refinement, and network coding.