International Zurich Seminar on Communications: proceedings
Institute of Electrical and Electronics Engineers IEEE Switzerland Chapter on Digital Communication Systems New York, NY · Open Repository and Bibliography (University of Luxembourg) · 2010
Existing edge-cut bounds for network coding are refined to include different rate weights. EDGE-CUT BOUNDS AND RATE WEIGHTSCut-set bounds that partition network nodes are a standard method for understanding network information flow [1].Several recent improvements of these methods focus instead on network edges [2]-[5].One limitation of the new bounds is that they treat source messages "equally" in the sense that each source rate R s has the same weight.We here outline a simple refinement that introduces variable rate weights.We focus on the methods of [2], [5] but our approach also applies to the methods described in [3], [4], for example.Consider a network graph (V, E) where V is a set of vertices (or nodes) and E is a set of edges.Consider the derivation in [5, Appendix] where the first few steps give k∈S d