Bounding multiple unicasts through index coding and locally repairable codes
K Shanmugam, AG Dimakis - 2014 IEEE International …, 2014 - ieeexplore.ieee.org
We establish a duality result between linear index coding and Locally Repairable Codes
(LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally …
(LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally …
Sending perishable information: Coding improves delay-constrained throughput even for single unicast
This paper considers network communications under a hard timeliness constraint, where a
source node streams perishable information to a destination node over a directed acyclic …
source node streams perishable information to a destination node over a directed acyclic …
Two-unicast is hard
Consider the k-unicast network coding problem over an acyclic wireline network: Given a
rate vector k-tuple, determine whether the network of interest can support k unicast flows …
rate vector k-tuple, determine whether the network of interest can support k unicast flows …
Precoding-based network alignment for three unicast sessions
We consider the problem of network coding across three unicast sessions over a directed
acyclic graph, where the sender and receiver of each unicast session are both connected to …
acyclic graph, where the sender and receiver of each unicast session are both connected to …
The two-unicast problem
We consider the communication capacity of wireline networks for a two-unicast traffic
pattern. The network has two sources and two destinations with each source communicating …
pattern. The network has two sources and two destinations with each source communicating …
An edge reduction lemma for linear network coding and an application to two-unicast networks
W Zeng, VR Cadambe… - 2012 50th Annual Allerton …, 2012 - ieeexplore.ieee.org
In this paper, we study linear network coding over a wireline network of orthogonal
capacitated links represented by a directed acyclic graph. Applying the algebraic framework …
capacitated links represented by a directed acyclic graph. Applying the algebraic framework …
An achievable region for the double unicast problem based on a minimum cut analysis
S Huang, A Ramamoorthy - IEEE transactions on …, 2013 - ieeexplore.ieee.org
We consider the multiple unicast problem under network coding over directed acyclic
networks when there are two source-terminal pairs, s 1-t 1 and s 2-t 2. The capacity region …
networks when there are two source-terminal pairs, s 1-t 1 and s 2-t 2. The capacity region …
On the multiple-unicast capacity of 3-source, 3-terminal directed acyclic networks
S Huang, A Ramamoorthy - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
We consider the multiple-unicast problem with three source-terminal pairs over directed
acyclic networks with unit-capacity edges. The three s it i pairs wish to communicate at unit …
acyclic networks with unit-capacity edges. The three s it i pairs wish to communicate at unit …
Delay-constrained unicast and the triangle-cast problem
We consider the single-unicast communication problem in a network with a delay constraint.
For this setting, it has recently been shown that network coding offers an advantage over …
For this setting, it has recently been shown that network coding offers an advantage over …
Two unicast information flows over linear deterministic networks
We investigate the two unicast flow problem over layered linear deterministic networks with
arbitrary number of nodes. When the minimum cut value between each source-destination …
arbitrary number of nodes. When the minimum cut value between each source-destination …