On the multiple unicast network coding conjecture
In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. Loosely speaking, we show that under certain...
Main Authors: | Langberg, Michael (Author), Medard, Muriel (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2010-10-29T16:19:41Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Alignment-Based Network Coding for Two-Unicast-Z Networks
by: Zeng, Weifei, et al.
Published: (2017) -
Resilient flow decomposition of unicast connections with network coding
by: Babarczi, Peter, et al.
Published: (2016) -
A recursive coding algorithm for two-unicast-Z networks
by: Zeng, Weifei, et al.
Published: (2016) -
Linear algebraic approaches to coding for multiple unicast networks
by: Zeng, Weifei
Published: (2016) -
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast
by: Matsumoto Ryutaroh, et al.
Published: (2010-01-01)