scientific article; zbMATH DE number 2154122
From MaRDI portal
Publication:4664671
zbMATH Open1063.94542MaRDI QIDQ4664671FDOQ4664671
Authors: Pierre Loidreau, E. M. Gabidulin 
Publication date: 8 April 2005
Title of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Rank-metric codes as ideals for subspace codes and their weight properties
- Tensor representation of rank-metric codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- An Assmus-Mattson theorem for rank metric codes
- MRD codes: constructions and connections
- New rank codes based encryption scheme using partial circulant matrices
- Theory of codes with maximum rank distance
- On the dimension of subfield subcodes
- On dually almost MRD codes
- Rank subcodes in multicomponent network coding
- Multicomponent codes with maximum code distance
- A note on equidistant subspace codes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Weight distribution of rank-metric codes
- Erasure techniques in MRD codes.
- MRD codes with maximum idealizers
- Matrix graphs and MRD codes over finite principal ideal rings
- Constructing MRD codes by switching
- Systematic maximum sum rank 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)
