Weighted sum-rate functional dependence bound for network coding capacity
Guan, Yong Liang
Date of Issue2012
International Symposium on Information Theory and its Applications (ISITA 2012)
School of Electrical and Electronic Engineering
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.
DRNTU::Engineering::Electrical and electronic engineering
© 2012 Institute of Electronics, Information and Communication Engineers (IEICE). This paper was published in 2012 International Symposium on Information Theory and Its Applications, ISITA 2012 and is made available as an electronic reprint (preprint) with permission of Institute of Electronics, Information and Communication Engineers (IEICE). The paper can be found at the following official URL: [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]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.