A separation theorem for single-source network coding

DOI10.1109/TIT.2006.872983MaRDI QIDQ3547652zbMATH OpenOpenAlexFDO

Authors Lihua Song, Richard W. Yeung, Ning Cai

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.872983

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Separation of Source-Network Coding and Channel Coding in Wireline Networks
• Separating distributed source coding from network coding.
• Secure network coding for multiple unicast: on the case of single source
• The encoding complexity of network coding
• scientific article; zbMATH DE number 2135149
• Information flow decomposition for network coding
• On the Sub-Optimality of Single-Letter Coding Over Networks
• A computational perspective on network coding
• Optimality and Approximate Optimality of Source-Channel Separation in Networks
• Bounding the Coding Advantage of Combination Network Coding in Undirected Networks

Cited in

(7)

• The source-channel separation theorem revisited
• On the source-channel separation theorem for infinite source alphabets
• Separating distributed source coding from network coding.
• scientific article; zbMATH DE number 2135150 (Why is no real title available?)
• scientific article; zbMATH DE number 3543914 (Why is no real title available?)
• An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding
• Network information flow with correlated sources

This page was built for publication: A separation theorem for single-source network coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547652)