scientific article; zbMATH DE number 910964

zbMATH Open0859.94025MaRDI QIDQ4886141FDOQ4886141

Authors: E. M. Gabidulin 

Publication date: 9 April 1997

Title of this publication is not available (Why is that?)

Recommendations

• Error and erasure correcting algorithms for rank codes
• New technique for decoding codes in the rank metric and its cryptography applications
• Encoding and decoding of several optimal rank metric codes
• Fast decoding of Gabidulin codes
• Maximum-rank array codes and their application to crisscross error correction

zbMATH Keywords

MRD codescodes with maximal rank distancefast matrix decoding algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Cited In (12)

• Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound
• Error and erasure correcting algorithms for rank codes
• A module minimization approach to Gabidulin decoding via interpolation
• New technique for decoding codes in the rank metric and its cryptography applications
• Linear codes using skew polynomials with automorphisms and derivations
• Maximum-rank array codes and their application to crisscross error correction
• Fast decoding of Gabidulin codes
• On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
• Attacks and counter-attacks on the GPT public key cryptosystem
• Decoding of random network codes
• A new identification algorithm
• Rank-metric codes and their applications

This page was built for publication:

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