Key points are not available for this paper at this time.
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.
Ho et al. (Wed,) studied this question.