On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.

DOI10.1016/j.crma.2004.10.004zbMath1060.94044OpenAlexW1963928681MaRDI QIDQ1763501

Pierre Loidreau

Publication date: 22 February 2005

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2004.10.004

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of codes with maximum rank distance
• Reducible rank codes and their applications to cryptography
• Maximum-rank array codes and their application to crisscross error correction

This page was built for publication: On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.