Cohen, Asaf and Avestimehr, Salman and Effros, Michelle (2009) On networks with side information. In: ISIT 2009. IEEE , Piscataway, NJ, pp. 1343-1347. ISBN 978-1-4244-4312-3 http://resolver.caltech.edu/CaltechAUTHORS:20100816-093044500
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100816-093044500
In this paper, we generalize the lossless coded side information problem from the three-node network of Ahlswede and K¨orner 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.
|Item Type:||Book Section|
|Additional Information:||© 2009 IEEE. This work is partially supported by DARPA Grant W911NF-07-I0029, Lee Center for Advanced Networking at Caltech and the Center for Mathematics of Information at Caltech. The authors would like to thank Mayank Bakshi for several interesting and fruitful discussions. The helpful remarks of the referees are also gratefully acknowledged.|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||16 Aug 2010 18:16|
|Last Modified:||26 Dec 2012 12:19|
Repository Staff Only: item control page