scientific article; zbMATH DE number 2154122

MaRDI QIDQ4664671zbMATH OpenFDO

Authors Pierre Loidreau, E. M. Gabidulin

Publication date 8 April 2005

zbMATH Keywords

distance codesmaximal rankMRD codesrank distancerank weightsubfield subcodes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• MRD codes: constructions and connections
• Theory of codes with maximum rank distance
• Puncturing maximum rank distance codes
• MRD codes with maximum idealizers
• Explicit constructions of some non-Gabidulin linear maximum rank distance codes

Cited in

(21)

• Theory of codes with maximum rank distance
• On dually almost MRD codes
• Weight distribution of rank-metric codes
• Systematic maximum sum rank codes
• Matrix graphs and MRD codes over finite principal ideal rings
• Rank-metric codes as ideals for subspace codes and their weight properties
• New rank codes based encryption scheme using partial circulant matrices
• Multicomponent codes with maximum code distance
• Structural attacks for public key cryptosystems based on Gabidulin codes
• Erasure techniques in MRD codes.
• MRD codes: constructions and connections
• On the dimension of subfield subcodes
• Rank subcodes in multicomponent network coding
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Tensor representation of rank-metric codes
• An Assmus-Mattson theorem for rank metric codes
• Constructing MRD codes by switching
• MRD codes with maximum idealizers
• A note on equidistant subspace codes

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