Referenced Items are not available for this document.
This paper considers the problem of network coding for multiple unicast connections in networks represented by directed acyclic graphs. The concept of interference alignment, traditionally used in interference networks, is extended to analyze the performance of linear network coding in this setup and to provide a systematic code design approach. It is shown that, for a broad class of three-source three-destination unicast networks, a rate corresponding to half the individual source-destination min-cut is achievable via alignment strategies.
Published in:
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Date of Conference: 13-18 June 2010
- Page(s):
- 1878 - 1882
- E-ISBN :
- 978-1-4244-7891-0
- Print ISBN:
- 978-1-4244-7890-3
- INSPEC Accession Number:
- 11434220
- Conference Location :
- Austin, TX
- Digital Object Identifier :
- 10.1109/ISIT.2010.5513311
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
