Network coding from a network flow perspective
- 1 January 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- The benefits of coding over routing in a randomized settingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An algebraic approach to network codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Constructing a perfect matching is in random NCCombinatorica, 1986