Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2003 | public
Book Section - Chapter

Network coding from a network flow perspective

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.

Additional Information

© 2003 IEEE. Issue Date: 29 June-4 July 2003. Date of Current Version: 15 September 2003.

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023