Constructing MRD codes by switching
From MaRDI portal
Recommendations
Cites work
- A new family of linear maximum rank distance codes
- Additive Rank Metric Codes
- Algebraic structures of MRD codes
- An asymptotic lower bound on the number of bent functions
- Bilinear forms over a finite field, with applications to coding theory
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Galois theory and linear algebra
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Minimum supports of eigenfunctions in bilinear forms graphs
- Minimum supports of eigenfunctions of graphs: a survey
- MRD codes: constructions and connections
- Non-linear maximum rank distance codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- On perfect codes and related concepts
- On the genericity of maximum rank distance and Gabidulin codes
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- On the number of SQSs, Latin hypercubes and MDS codes
- Scattered subspaces and related codes
- Some new non-additive maximum rank distance codes
- Switching codes and designs
- Switching Construction of Planar Functions on Finite Fields
- Switching Sets in PG(3, q)
- Switchings of semifield multiplications
- Theory of codes with maximum rank distance
- Transversals in Latin squares: a survey
Cited in
(2)
This page was built for publication: Constructing MRD codes by switching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494519)
