Weighted sum-rate functional dependence bound for network coding capacity
Explicit characterization of network coding capacity for multi-source multi-sink networks is an extremely hard problem. The linear programming bound is an explicit outer bound on network coding capacity but it is computationally very intensive. An edge-cut bound called functional dependence bound is...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/103012 http://hdl.handle.net/10220/19130 http://ieeexplore.ieee.org.ezlibproxy1.ntu.edu.sg/xpl/login.jsp?tp=&arnumber=6400960&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F6384623%2F6400891%2F06400960.pdf%3Farnumber%3D6400960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Explicit characterization of network coding capacity for multi-source multi-sink networks is an extremely hard problem. The linear programming bound is an explicit outer bound on network coding capacity but it is computationally very intensive. An edge-cut bound called functional dependence bound is an easily computable relaxation of the linear programming bound. However, the functional dependence bound is still very loose, even for two source unicast networks. In this paper, we characterize a set of Shannon-type inequalities for a given network that leads to new weighted bounds providing strict improvement over the functional dependence bound. |
|---|