Binary additive MRD codes with minimum distance n-1 must contain a semifield spread set

From MaRDI portal
Publication:2329397

DOI10.1007/S10623-019-00637-6zbMATH Open1447.94068arXiv1808.08854OpenAlexW2962938698MaRDI QIDQ2329397FDOQ2329397


Authors: John Sheekey Edit this on Wikidata


Publication date: 17 October 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In this paper we prove a result on the structure of the elements of an additive {it maximum rank distance (MRD) code} over the field of order two, namely that in some cases such codes must contain a semifield spread set. We use this result to classify additive MRD codes in Mn(mathbbF2) with minimum distance n1 for nleq6. Furthermore we present a computational classification of additive MRD codes in M4(mathbbF3). The computational evidence indicates that MRD codes of minimum distance n1 are much more rare than MRD codes of minimum distance n, i.e. semifield spread sets. In all considered cases, each equivalence class has a known algebraic construction.


Full work available at URL: https://arxiv.org/abs/1808.08854




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set

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