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

DOI10.1016/J.CRMA.2004.10.004MaRDI QIDQ1763501zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Coding and Cryptography
• Fast decoding of Gabidulin codes
• Decoding algorithm for Gabidulin codes
• Erasure decoding for Gabidulin codes
• Fast operations on linearized polynomials and their applications in coding theory

Cites work

• scientific article; zbMATH DE number 6488188 (Why is no real title available?)
• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• scientific article; zbMATH DE number 910964 (Why is no real title available?)
• Maximum-rank array codes and their application to crisscross error correction
• Reducible rank codes and their applications to cryptography
• Theory of codes with maximum rank distance

Cited in

(4)

• Coding and Cryptography
• Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
• Low-rank matrix recovery using Gabidulin codes in characteristic zero
• Fast operations on linearized polynomials and their applications in coding theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763501)