The benefits of coding over routing in a randomized setting

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 442-

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

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

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA COMPRESSION; DECODING; INFORMATION RETRIEVAL SYSTEMS; MULTICASTING; TELECOMMUNICATION LINKS;

DISTRIBUTED INFORMATION COMPRESSION; DISTRIBUTED INFORMATION TRANSMISSION; RANDOMIZED NETWORK CODING;

SIGNAL ENCODING;

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

References (4)

1. R. Ahlswede, N. Cai, S.-Y.R. Li and R.W. Yeung, "Network Information Flow", IEEE-IT, vol. 46, pp. 1204-1216, 2000.
2. T. Ho, D. R. Karger, M. Médard and R. Koetter, "Network Coding from a Network Flow Perspective", ISIT 2003.
3. R. Koetter and M. Médard, "An Algebraic Approach to Network Coding", IEEE/ACM Transactions on Networking, to appear.
4. S. D. Servetto, G. Barrenechea. "Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks", Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002.