Codes for network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 867-870

  Gabidulin, Ernst M ^a   Bossert, Martin ^b  

^a MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; NETWORK CODING;

CODES (SYMBOLS); CYBERNETICS; ERROR CORRECTION; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

CODES (STANDARDS);

EID: 52349119169     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595110     Document Type: Conference Paper

References (6)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, July 2000.
2. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In ISIT, July 2003.
3. C. Fragouli and E. Soljanin. Decentralized network coding. Information Theory Workshop, Oct. 2004.
4. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in Proc. IEEE Int. Symp. Information Theory, Nice, France, 24-29 June 2007, pp. 791-795.
5. D. Silva and F. R. Kschischang, "Using rank-metric codes for error correction in random network coding." in Proc. IEEE Int. Symp. Information Theory, Nice, France, 24-29 June 2007.
6. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs. New York, NY: Springer Verlag, 1989.