Maximum scattered linear sets and MRD-codes

From MaRDI portal




Abstract: The rank of a scattered mathbbFq-linear set of mathrmPG(r1,qn), rn even, is at most rn/2 as it was proved by Blokhuis and Lavrauw. Existence results and explicit constructions were given for infinitely many values of r, n, q (rn even) for scattered mathbbFq-linear sets of rank rn/2. In this paper we prove that the bound rn/2 is sharp also in the remaining open cases. Recently Sheekey proved that scattered mathbbFq-linear sets of mathrmPG(1,qn) of maximum rank n yield mathbbFq-linear MRD-codes with dimension 2n and minimum distance n1. We generalize this result and show that scattered mathbbFq-linear sets of mathrmPG(r1,qn) of maximum rank rn/2 yield mathbbFq-linear MRD-codes with dimension rn and minimum distance n1.



Cites work


Cited in
(43)






This page was built for publication: Maximum scattered linear sets and MRD-codes

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