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

DOI10.1016/J.CRMA.2004.10.004zbMATH Open1060.94044OpenAlexW1963928681MaRDI QIDQ1763501FDOQ1763501

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Theory of codes with maximum rank distance
• Maximum-rank array codes and their application to crisscross error correction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reducible rank codes and their applications to cryptography

Cited In (4)

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

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)