Edge-Cut Bounds on Network Coding Rates

Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upon a flow cut-set bound that is standard in networking. It follows that routing is rate-optimal if routing achieves the standard flow cut-set bound. The second bound improves on the cut-set bound, and it involves progressively removing edges from a network graph and checking whether certain strengthened dseparation conditions are satisfied.

• Type: Journal
• Year: 2006
• Where: JNSM
• Authors: Gerhard Kramer, Serap A. Savari
• Keywords: Cut-set Bound, JNSM 2006, Routing, Simpler Bound