Conference proceeding
On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
01 Jan 2019
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.
Metrics
2 Record Views
Details
- Title
- On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region
- Creators
- Yirui Liu - Drexel Univ, Dept Elect & Comp Engn, Philadelphia, PA 19104 USAJohn MacLaren Walsh - Drexel Univ, Dept Elect & Comp Engn, Philadelphia, PA 19104 USAIEEE
- Publication Details
- 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
- Conference
- 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
- Series
- IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Number of pages
- 5
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Identifiers
- 991019170342004721
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Computer Science, Information Systems
- Computer Science, Theory & Methods