Using rank-metric codes for error correction in random network coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 796-800

  Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PARTIAL INFORMATION; RANDOM NETWORKS;

CODES (SYMBOLS); COMPUTER NETWORKS; CYBERNETICS; DECODING; INFORMATION THEORY; PROGRAMMING THEORY; RANDOM PROCESSES; SIGNAL ENCODING; TECHNICAL PRESENTATIONS; TELECOMMUNICATION NETWORKS; VIDEO STREAMING;

ERROR CORRECTION;

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

References (12)

1. T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. on Inform. Theory, vol. 52, pp. 4413-4430, Oct. 2006.
2. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Médard, "Resilient network coding in the presence of Byzantine adversaries," in Proc. 26th Annual IEEE Conf. on Computer Commun., Anchorage, AK, May 2007, to appear.
3. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in Proc. IEEE Int. Symp. Information Theory, Nice, France, June 2007, accepted for publication.
4. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm, vol. 21, no. 1, pp. 1-12, 1985.
5. E. Gabidulin and N. Pilipchuk, "A new method of erasure correction by rank codes," in Proc. IEEE Int. Symp. Information Theory, 29 June-4 July 2003, p. 423.
6. G. Richter and S. Plass, "Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm," in Proc. of ITG Conference on Source and Channel Coding, Erlangen, Germany, January 2004.
7. _, "Fast decoding of rank-codes with rank errors and column erasures," in Proc. IEEE Int. Symp. Information Theory, 27 June-2 July 2004, pp. 398-398.
8. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Allerton Conf. on Comm., Control, and Computing, Monticello, IL, October 2003.
9. D. Silva and F R. Kschischang, "Using rank-metric codes for error correction in random network coding," to be submitted to IEEE Trans. on Inform. Theory, 2007.
10. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983.
11. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
12. V. Skachek and R. M. Roth, "Probabilistic algorithm for finding roots of linearized polynomials," Computer Science Department, Technion, Technical Report CS-2004-08, June 2004.