On the separation of channel and network coding in aref networks
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1716-1719
- https://doi.org/10.1109/isit.2005.1523638
Abstract
It is shown that one cannot always layer, or separate, channel and network coding for multicasting in deterministic relay networks with no interference. We call such networks Aref networks. The suboptimality of such layering in Aref networks is in contrast to the optimality of a similar layering in networks of discrete memoryless channels and certain networks of two-way channelsKeywords
This publication has 9 references indexed in Scilit:
- On coding for reliable communication over packet networksPhysical Communication, 2008
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- On the capacity of wireless erasure relay networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Cut sets and information flow in networks of two-way channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Network information flow: limits and achievabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Elements of Information TheoryPublished by Wiley ,2001
- Network information flowIEEE Transactions on Information Theory, 2000
- The capacity region for the deterministic broadcast channel with a common message (Corresp.)IEEE Transactions on Information Theory, 1981