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: | Xu, Xiaoli, Thakor, S., Guan, Yong Liang |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
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 |
Similar Items
-
An achievable region for double-unicast networks with linear network coding
by: Zeng, Yong, et al.
Published: (2014) -
Curious bounds for floor function sums
by: Thotsaporn Thanatipanonda, et al.
Published: (2019) -
Explicit low-bandwidth evaluation schemes for weighted sums of Reed-Solomon-coded symbols
by: Kiah, Han Mao, et al.
Published: (2023) -
Batched network coding with adaptive recoding for multi-hop erasure channels with memory
by: Xu, Xiaoli, et al.
Published: (2019) -
Meeting the Levenshtein bound with equality by weighted-correlation complementary set
by: Liu, Zi Long, et al.
Published: (2013)