Network coding from a network flow perspective
T. Ho, David R. Karger, Muriel Médard, R. Koetter · 2003
Precise connections between algebraic network coding and network flows are explained in this article. Our combinatorial formulations offer new insights, mathematical simplicity, and lead to a substantially tighter upper bound on the coding field size required for a given connection problem than that in R. Koetter et al.