Technical Program

Paper Detail

Paper Title On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region
Paper IdentifierMO2.R2.4
Authors Yirui Liu, John MacLaren Walsh, Drexel University, United States
Session Network Coding I
Location Saint Germain, Level 3
Session Time Monday, 08 July, 11:40 - 13:00
Presentation Time Monday, 08 July, 12:40 - 13:00
Manuscript  Click here to download the manuscript
Abstract A new method is presented, consisting of exclusively simple linear algebra computations, for computing the linear programming Shannon outer bound to the network coding capacity region of a directed hypergraph network. This linear algebraic formulation enables a new upper bound on the worst case complexity of computing the Shannon outer bound to a network coding capacity region to be determined.