Published August 18, 2009
| Published
Book Section - Chapter
Open
On networks with side information
Abstract
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.
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.Attached Files
Published - Cohen2009p110792009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
Cohen2009p110792009_Ieee_International_Symposium_On_Information_Theory_Vols_1-_4.pdf
Files
(516.4 kB)
Name | Size | Download all |
---|---|---|
md5:682c37a863fd2536868eda7f5fb67033
|
516.4 kB | Preview Download |
Additional details
- Eprint ID
- 19435
- Resolver ID
- CaltechAUTHORS:20100816-093044500
- W911NF-07-I0029
- Defense Advanced Research Projects Agency (DARPA)
- Caltech Lee Center for Advanced Networking
- Caltech Center for Mathematics of Information
- Created
-
2010-08-16Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 10842443