On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks
- Creators
- Jalali, Shirin
- Effros, Michelle
Abstract
This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of achievable distortion matrices in delivering a family of dependent sources across such a network equals the set of achievable distortion matrices for delivering the same sources across a distinct network which is built by replacing each channel by a noiseless, point-to-point bit-pipe of the corresponding capacity. Thus a code that applies source-network coding across links that are made almost lossless through the application of independent channel coding across each link asymptotically achieves the optimal performance across the network as a whole.
Additional Information
© 2010 IEEE. Issue Date: 13-18 June 2010, Date of Current Version: 23 July 2010. SJ is supported by the Center for Mathematics of Information at Caltech, and ME is supported by the DARPA ITMANET program under grant number W911NF-07-1-0029.Attached Files
Published - Jalali2010p132822010_Ieee_International_Symposium_On_Information_Theory.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:fcbac5a6b8738585db1508f9e11befaa
|
131.9 kB | Preview Download |
Additional details
- Eprint ID
- 23153
- Resolver ID
- CaltechAUTHORS:20110329-101424835
- W911NF-07-1-0029
- Defense Advanced Research Projects Agency (DARPA)
- Caltech Center for Mathematics of Information
- Created
-
2011-03-29Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- IEEE International Symposium on Information Theory
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 11446006