Progressive d-separating edge set bounds on network coding rates Conference Paper

abstract

• 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.

name of conference

• Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

authors

• Savari, Serap

published proceedings

• 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2

author list (cited authors)

• Kramer, G., & Savari, S. A.

citation count

• 9

complete list of authors

• Kramer, G||Savari, SA

publication date

• January 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences
• 4613 Theory Of Computation
• 49 Mathematical Sciences
• 4901 Applied Mathematics
• 4904 Pure Mathematics

Digital Object Identifier (DOI)

• 10.1109/isit.2005.1523612

International Standard Book Number (ISBN) 10

• 0-7803-9150-0

International Standard Book Number (ISBN) 13

• 9780780391512

start page

• 1588

end page

• 1592

volume

• 2005

URL

• http://dx.doi.org/10.1109/isit.2005.1523612