Saturating linear sets in PG(2,q4)
Abstract
Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study 1-saturating linear sets in PG(2,q4), that is Fq-linear sets in PG(2,q4) with the property that their secant lines cover the entire plane. By making use of a characterization of generalized Gabidulin codes, we prove that the rank of such a linear set is at least 5. This answers to a recent question posed by Bartoli, Borello and Marino.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.