English

Connections between scattered linear sets and MRD-codes

Combinatorics 2020-01-29 v1 Information Theory math.IT

Abstract

The aim of this paper is to survey on the known results on maximum scattered linear sets and MRD-codes. In particular, we investigate the link between these two areas. In "A new family of linear maximum rank distance codes" (2016) Sheekey showed how maximum scattered linear sets of PG(1,qn)\mathrm{PG}(1,q^n) define square MRD-codes. Later in "Maximum scattered linear sets and MRD-codes" (2017) maximum scattered linear sets in PG(r1,qn)\mathrm{PG}(r-1,q^n), r>2r>2, were used to construct non square MRD-codes. Here, we point out a new relation regarding the other direction. We also provide an alternative proof of the well-known Blokhuis-Lavrauw's bound for the rank of maximum scattered linear sets shown in "Scattered spaces with respect to a spread in PG(n,q)\mathrm{PG}(n,q)" (2000).

Keywords

Cite

@article{arxiv.2001.10067,
  title  = {Connections between scattered linear sets and MRD-codes},
  author = {Olga Polverino and Ferdinando Zullo},
  journal= {arXiv preprint arXiv:2001.10067},
  year   = {2020}
}

Comments

Accepted for publication in Bulletin of the Institute of Combinatorics and its Applications

R2 v1 2026-06-23T13:22:19.186Z