JNSM
2006
13 years 4 months ago
2006
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 upo...
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...