A Caltech Library Service

Network coding from a network flow perspective

Ho, Tracey and Karger, David R. and Médard, Muriel and Koetter, Ralf (2003) Network coding from a network flow perspective. In: 2003 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 441. ISBN 0-7803-7728-1.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
Additional Information:© 2003 IEEE. Issue Date: 29 June-4 July 2003. Date of Current Version: 15 September 2003.
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number8547838
Record Number:CaltechAUTHORS:20111014-145416422
Persistent URL:
Official Citation:Ho, T.; Karger, D.R.; Medard, M.; Koetter, R.; , "Network coding from a network flow perspective," Information Theory, 2003. Proceedings. IEEE International Symposium on , vol., no., pp. 441, 29 June-4 July 2003 doi: 10.1109/ISIT.2003.1228458 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:27238
Deposited By: Tony Diaz
Deposited On:17 Oct 2011 16:31
Last Modified:09 Nov 2021 16:47

Repository Staff Only: item control page