Network Coding for Multiple Unicasts: An Interference Alignment Approach
arXiv:1008.0235
Abstract
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.
5 pages, appeared in ISIT 2010
References in corpus (5)
- Interference Alignment and the Degrees of Freedom for the K User Interference Channel
- Real Interference Alignment with Real Numbers
- Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
- Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
- Coding for Errors and Erasures in Random Network Coding
Cited by in corpus (9)
- Topological Interference Management through Index Coding
- Index Coding - An Interference Alignment Perspective
- On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding
- On the Feasibility of Precoding-Based Network Alignment for Three Unicast Sessions
- Computation in Multicast Networks: Function Alignment and Converse Theorems
- Alignment based Network Coding for Two-Unicast-Z Networks
- On the Capacity of the Finite Field Counterparts of Wireless Interference Networks
- A note on the multiple unicast capacity of directed acyclic networks
- On Interference Networks over Finite Fields