A Welch-Berlekamp like algorithm for decoding Gabidulin codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3969 LNCS, Issue , 2006, Pages 36-45

  Loidreau, Pierre ^a  

^a ENSTA PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECODING; ERROR ANALYSIS; POLYNOMIALS;

GABIDULIN CODES; LINEARIZED POLYNOMIALS; POLYNOMIAL RECONSTRUCTION; REED-SOLOMON CODES;

CODES (SYMBOLS);

EID: 33746776831     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779360_4     Document Type: Conference Paper

References (12)

1. E. R. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent, Number 4,633,470, 1986.
2. F. Chabaud and J. Stern. The cryptographic security of the syndrome decoding problem for rank distance codes. In K. Kim and T. Matsumoto, editors, Advances in Cryptology - ASIACRYPT '96, volume 1163 of LNCS. Springer-Verlag, November 1996.
3. E. M. Gabidulin. Theory of codes with maximal rank distance. Problems of Information Transmission, 21:1-12, July 1985.
4. E. M. Gabidulin. A fast matrix decoding algorithm for rank-error correcting codes. In G. Cohen, S. Litsyn, A. Lobstein, and G. Zernor, editors, Algebraic coding, volume 573 of LNCS, pages 126-133. Springer-Verlag, 1991.
5. E. M. Gabiduliri, A. V. Paramonov, and O. V. Tretjakov. Ideals over a noncommutative ring and their application in cryptology. In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT'91, volume 547 of LNCS, pages 482-489. Springer-Verlag, 1991.
6. P. Loidreau. Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin. Comptes Rendus de l'Académie des Sciences: Série I, 339(10):745-750, 2004.
7. Ø, Ore, On a special class of polynomials. Trans actions of the American Mathematical Society, 35:559-584, 1933.
8. Ø. Ore. Contribution to the theory of finite fields. Transactions of the American Mathematical Society, 36:243-274, 1934.
9. A. Ourivski and T. Johannson. New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, 38(3):237-246, September 2002.
10. G. Richter and S. Plass. Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. In 5th Int. ITG Conference on Source and Channel Coding (SCC 04), 2004.
11. R. M. Roth. Maximum-Rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory, 37(2):328-336, March 1991.
12. M. Sudan. Decoding Reed-Solomon codes beyond the error-correction diameter. In Proceedings of the 35th Annual Allerton Conference on Communication, Control and Computing, pages 215-224, 1997.