Progressive d-separating edge set bounds on network coding rates

Gerhard Kramer, Scrap A. Savari

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages1588-1592
Number of pages5
DOIs
StatePublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2005
ISSN (Print)2157-8099

Conference

Conference2005 IEEE International Symposium on Information Theory, ISIT 05
Country/TerritoryAustralia
CityAdelaide
Period4/09/059/09/05

Fingerprint

Dive into the research topics of 'Progressive d-separating edge set bounds on network coding rates'. Together they form a unique fingerprint.

Cite this