TY - GEN
T1 - Progressive d-separating edge set bounds on network coding rates
AU - Kramer, Gerhard
AU - Savari, Scrap A.
PY - 2005
Y1 - 2005
N2 - A bound on network coding rates is developed that generalizes an edge-cut bound on routing rates. The bound involves progressively removing edges from a network graph and checking whether certain strengthened d-separation conditions are satisfied. The bound improves on the cut-set bound, and its efficacy is demonstrated by showing that routing is rate-optimal for some commonly cited examples in the networking literature.
AB - A bound on network coding rates is developed that generalizes an edge-cut bound on routing rates. The bound involves progressively removing edges from a network graph and checking whether certain strengthened d-separation conditions are satisfied. The bound improves on the cut-set bound, and its efficacy is demonstrated by showing that routing is rate-optimal for some commonly cited examples in the networking literature.
UR - http://www.scopus.com/inward/record.url?scp=33749437065&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2005.1523612
DO - 10.1109/ISIT.2005.1523612
M3 - Conference contribution
AN - SCOPUS:33749437065
SN - 0780391519
SN - 9780780391512
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1588
EP - 1592
BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -