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

From MaRDI portal
Publication:2329397



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 n−1 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 n−1 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.




Cites work



Describes a project that uses

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)