TY - GEN
T1 - On networks with side information
AU - Cohen, Asaf
AU - Avestimehr, Salman
AU - Effros, Michelle
PY - 2009/11/19
Y1 - 2009/11/19
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449503912&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205925
DO - 10.1109/ISIT.2009.5205925
M3 - Conference contribution
AN - SCOPUS:70449503912
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1343
EP - 1347
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -