Published June 2003
| public
Book Section - Chapter
Network coding from a network flow perspective
Chicago
An error occurred while generating the citation.
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
- Eprint ID
- 27238
- DOI
- 10.1109/ISIT.2003.1228458
- Resolver ID
- CaltechAUTHORS:20111014-145416422
- Created
-
2011-10-17Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 8547838