A separation theorem for single-source network coding
From MaRDI portal
Publication:3547652
DOI10.1109/TIT.2006.872983zbMATH Open1318.94042OpenAlexW2151959580MaRDI QIDQ3547652FDOQ3547652
Lihua Song, Ning Cai, Richard W. Yeung
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
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 (6)
- Separating distributed source coding from network coding.
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding
- Network information flow with correlated sources
- The source-channel separation theorem revisited
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)
