Constructing MRD codes by switching
From MaRDI portal
Publication:6494519
DOI10.1002/JCD.21931WikidataQ128412533 ScholiaQ128412533MaRDI QIDQ6494519
Minjia Shi, Ferruh Özbudak, Denis S. Krotov
Publication date: 30 April 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-linear maximum rank distance codes
- Switchings of semifield multiplications
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Switching codes and designs
- Galois theory and linear algebra
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- On the genericity of maximum rank distance and Gabidulin codes
- Some new non-additive maximum rank distance codes
- Scattered subspaces and related codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Minimum supports of eigenfunctions in bilinear forms graphs
- Additive Rank Metric Codes
- 13. MRD codes: constructions and connections
- Switching Construction of Planar Functions on Finite Fields
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- On the number of SQSs, latin hypercubes and MDS codes
- Switching Sets in PG(3, q)
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- Minimum supports of eigenfunctions of graphs: a survey
- On perfect codes and related concepts
- An asymptotic lower bound on the number of bent functions
This page was built for publication: Constructing MRD codes by switching
