On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property

In recent work, Kamath et al. show that network code design for any k-unicast network reduces to network code design for a related 2-unicast network. The proof assumes that codes achieve their desired rates precisely (rather than approaching them asymptotically) and that error probability equals zero. We study two questions posed in but left unanswered by the Kamath et al. paper. The first asks whether the reduction for 0-error code design can be extended to show an equivalence in 0-error network capacity, which includes rates approached asymptotically. The second asks whether the reduction can be generalized to show an equivalence in Shannon capacity, which requires that error probability approach (but not necessarily hit) zero. While we do not solve these questions, we show that finding the k-unicast capacity reduces to finding the 2-unicast capacity under this reduction if and only if the so called “edge removal statement” is true for all networks. This equivalence holds under both 0-error and asymptotic notions of reliability.

[1]  David Tse,et al.  Two-unicast is hard , 2014, 2014 IEEE International Symposium on Information Theory.

[2]  Tracey Ho,et al.  On the impact of a single edge on the network coding capacity , 2011, 2011 Information Theory and Applications Workshop.

[3]  Michael Langberg,et al.  Source coding for dependent sources , 2012, 2012 IEEE Information Theory Workshop.

[4]  Randall Dougherty,et al.  Unachievability of network coding capacity , 2006, IEEE Transactions on Information Theory.

[5]  V. Anantharam,et al.  Generalized Network Sharing Outer Bound and the Two-Unicast Problem , 2011, 2011 International Symposium on Networking Coding.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Alex J. Grant,et al.  On capacity regions of non-multicast networks , 2010, 2010 IEEE International Symposium on Information Theory.

[8]  Michael Langberg,et al.  Network coding: Is zero error always possible? , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Alex J. Grant,et al.  Mission impossible: Computing the network coding capacity region , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Ness B. Shroff,et al.  Pairwise Intersession Network Coding on Directed Networks , 2010, IEEE Transactions on Information Theory.

[11]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[12]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[13]  Michael Langberg,et al.  On a capacity equivalence between network and index coding and the edge removal problem , 2013, 2013 IEEE International Symposium on Information Theory.

[14]  Shirin Jalali,et al.  On the separation of lossy source-network coding and channel coding in wireline networks , 2010, 2010 IEEE International Symposium on Information Theory.