Published July 23, 2010 | Version Published
Book Section - Chapter Open

On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks

  • 1. ROR icon California Institute of Technology

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

Jalali2010p132822010_Ieee_International_Symposium_On_Information_Theory.pdf

Files (131.9 kB)

Additional details

Identifiers

Eprint ID
23153
Resolver ID
CaltechAUTHORS:20110329-101424835

Funding

Defense Advanced Research Projects Agency (DARPA)
W911NF-07-1-0029
Caltech Center for Mathematics of Information

Dates

Created
2011-03-29
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field

Caltech Custom Metadata

Series Name
IEEE International Symposium on Information Theory
Other Numbering System Name
INSPEC Accession Number
Other Numbering System Identifier
11446006