Network coding from a network flow perspective

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 441-

  Ho, Tracey ^a   Karger, David R ^a   Médard, Muriel ^a   Koetter, Ralf ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; PROBLEM SOLVING;

ALGEBRAIC NETWORK CODING; ALGEBRAIC NETWORK FLOWS; UPPER BOUNDS;

SIGNAL ENCODING;

EID: 0141904214     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228458     Document Type: Conference Paper

References (6)

1. P. Ahlswede, N. Cai, S.-Y.R. Li and R.W. Yeung, "Network Information Flow", IEEE-IT, vol. 46, pp. 1204-1216, 2000.
2. A. Jaggi, P. A. Chou, K. Jain "Low Complexity Algebraic Network Multicast Codes", ISIT 2003.
3. T. Ho, R. Koetter, M. Médard, D. R. Karger and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting", ISIT 2003.
4. P. M. Karp, E. Upfal and A. Wigderson, "Constructing a Perfect Matching is in Random NC", Combinatorica 6 (1) (1986).
5. R. Koetter and M. Médard, "An Algebraic Approach to Network Coding", IEEE/ACM Transactions on Networking, to appear.
6. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial Time Algorithms For Network Information Flow".