Correcting generalized matrix erasures with applications to random network coding

2010 International ITG Conference on Source and Channel Coding, SCC 2010

Volumn , Issue , 2010, Pages

  Gabidulin, Ernst M ^a   Bosserr, Martin ^b   Pilipchuk, Nina I ^a  

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

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL MODEL; GENERALIZED MATRIX; METRIC CODES; RANDOM NETWORK CODING;

CHANNEL CODING; CODING ERRORS; INFORMATION THEORY;

RANDOM ERRORS;

EID: 77952781406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. E.M. Gabidulin, "Theory of Codes with Maximum Rank Distance," Probl. Inform. Transm., vol. 21, No.1, pp. 1-12, July, 1985.
2. D.Silva, F. R. Kschischang, R. Koetter, "A Rank-Metric Approach to Error Control in Random Network Coding," IEEE Transactions on Information Theory, vol. 54, pp. 3951-3967, No.9, Sept. 2008.
3. Gabidulin E.M, Bossert M, Lusina P. Space-Time Codes Based on Rank Codes // Proc. 2000 IEEE Int. Symposium on Information Theory. Sorrento, Italy. June, 2000. P. 283.
4. E. M. Gabidulin, "A Fast Matrix Decoding Algorithm for Rank-ErrorCorrecting Codes."In G. Cohen,S. Litsyn,A. Lobstein, G. Zemor(Eds.) ALGEBRAIC CODING, pp. 126 - 133; Lecture Notes in Computer Science v. 573, Springer-Verlag, 1991.
5. A. V. Paramonov,O. V. Tretjakov, "An analogueof Berlekamp - Massey algorithm for decoding codes in rank metric." In Proceed. MIPT, 1991 (In Russian).
6. A. V. Paramonov, "Channel coding and secure data transmission in parallel channels," Ph.D. thesis, Moscow Institute of Physics and Technology (MIPT), pp. 1-139, Moscow, 1992 (in Russian).
7. R. M. Roth, "Maximum-Rank array codes and their application to crisscross error correction," IEEE Transaction on Information Theory, 37(2): 328-336, March 1991.
8. G. Richter and S. Plass, "Fast decoding of rank codes with rank errors and column erasures." In Proc. of 2004 IEEE International Symposium on Information Theory, ISIT'04, 2004.
9. P.Loidreau. A Welch - Berlekamp like algorithm for decoding Gabidulin codes. In Ø. Itrehus (Ed.), Coding and Cryptography WCC 2005, 4th International Workshop on Coding and Cryptography. LNCS, no. 3969, p. 36-45, Springer, 2006.
10. D. Silva and F. R. Kschischang, "Fast Encoding and Decoding of Gabidulin Codes." Proc. of 2009 IEEE International Symposium on Information Theory, ISIT'09, 2009.
11. E.M.Gabidulin, A.V. Paramonov,O.V. Tretjakov "Rank Errorsand Rank Erasures Correction," Proceedings of the 4th International Colloquium on Coding Theory, 30 Sept. - 7 Oct. 1991, Dilijan, Armenia, pp. 11-19, Yerevan, 1992.
12. Ernst M. Gabidulin and Nina I. Pilipchuk, "Error and erasure correcting algorithms for rank codes," Designs,Codes and Cryptography, Springer Netherlands, DOl 10.1007/s10623-008-9185-7. V.49, 2008, pp.l05-122.
13. R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," in Proceedings of 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 24-29 June 2007, pp. 791-795.