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...
Main Authors: | Xu, Xiaoli, Thakor, S., Guan, Yong Liang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference Paper |
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 |
Similar Items
-
A new weight vector for a tighter Levenshtein bound on aperiodic correlation
by: Liu, Zilong, et al.
Published: (2014) -
Analysis of antenna selection rate in bi-directional network coded multi-antenna relay
by: Eslamifar, Mahshad, et al.
Published: (2013) -
A tighter correlation lower bound for quasi-complementary sequence sets
by: Liu, Zilong, et al.
Published: (2014) -
Speech coding algorithms based on vector-sum excitation and wavelet trasform
by: Tan, Kok Peng.
Published: (2009) -
Improving achievable rate for the two-user SISO interference channel with improper Gaussian signaling
by: Zeng, Yong, et al.
Published: (2013)