A new family of maximum scattered linear sets in PG(1,q^6)

We generalize the example of linear set presented by the last two authors in "Vertex properties of maximum scattered linear sets of PG(1,q^n)" (2019) to a more general family, proving that such linear sets are maximum scattered when q is odd and, apart from a special case, they are are new. This solves an open problem posed in "Vertex properties of maximum scattered linear sets of PG(1,q^n)" (2019). As a consequence of Sheekey's results in "A new family of linear maximum rank distance codes" (2016), this family yields to new MRD-codes with parameters (6,6,q;5).


page 1

page 2

page 3

page 4


Connections between scattered linear sets and MRD-codes

The aim of this paper is to survey on the known results on maximum scatt...

MRD-codes arising from the trinomial x^q+x^q^3+cx^q^5∈F_q^6[x]

In [10], the existence of F_q-linear MRD-codes of F_q^6× 6, with dimensi...

On the equivalence issue of a class of 2-dimensional linear Maximum Rank Distance codes

Recently A. Neri, P. Santonastaso and F. Zullo extended a family of 2-di...

New MRD codes from linear cutting blocking sets

Minimal rank-metric codes or, equivalently, linear cutting blocking sets...

Supercards, Sunshines and Caterpillar Graphs

The vertex-deleted subgraph G-v, obtained from the graph G by deleting t...

Parabola-Inscribed Poncelet Polygons Derived from the Bicentric Family

We study loci and properties of a Parabola-inscribed family of Poncelet ...

Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

We introduce a novel method to derandomize the learning with errors (LWE...

1. Introduction

Let , where

is a vector space of dimension

over . If is a -dimensional -subspace of , then the -linear set is defined as

and we say that has rank . Two linear sets and of are said to be -equivalent if there is an element in such that . It may happen that two –linear sets and of are -equivalent even if the -vector subspaces and are not in the same orbit of (see [11, 5] for further details). In this paper we focus on maximum scattered -linear sets of , that is, -linear sets of rank in of size .

If is not contained in the linear set of rank of (which we can always assume after a suitable projectivity), then for some linearized polynomial (or -polynomial) . In this case we will denote the associated linear set by . If is scattered, then is called a scattered -polynomial; see [23].

The first examples of scattered linear sets were found by Blokhuis and Lavrauw in [3] and by Lunardon and Polverino in [17] (recently generalized by Sheekey in [23]). Apart from these, very few known examples are known, see Section 3.

In [23, Sect. 5], Sheekey established a connection between maximum scattered linear sets of and MRD-codes, which are interesting because of their applications to random linear network coding and cryptography. We point out his construction in the last section. By the results of [1] and [2], it seems that examples of maximum scattered linear sets are rare.

In this paper we will prove that any


is a scattered -polynomial. This will be done by considering two cases:
Case 1: , that is, ; the condition implies .
Case 2: . In this case , otherwise and then we have , a contradiction to .

Note that in Case 1, this example coincides with the one introduced in [26], where it has been proved that is scattered for and . In Corollary 3.11 we will prove that the linear set associated with is new, apart from the case of a power of five and . This solves an open problem posed in [26].

Finally, in Section 4 we prove that the -linear MRD-codes with parameters arising from linear sets are not equivalent to any previously known MRD-code, apart from the case and a power of ; see Theorem 4.1.

2. is scattered

A -polynomial (or linearized polynomial) over is a polynomial of the form

where and is a positive integer. We will work with linearized polynomials of degree less than or equal to . For such a kind of polynomial, the Dickson matrix111This is sometimes called autocirculant matrix. is defined as

where for .

Recently, different results regarding the number of roots of linearized polynomials have been presented, see [4, 7, 21, 22, 25]. In order to prove that a certain polynomial is scattered, we make use of the following result; see [4, Theorem 3.4].

Theorem 2.1.

Let be the Dickson matrix associated with a nonzero -polynomial over . Denote by the submatrix of obtained by considering the last columns and the first rows of , with . Then if and only if

2.1. Case 1


By Theorem 2.1, is scattered if and only if for each the determinants of the following two matrices do not vanish at the same time

Theorem 2.2.

The polynomial is scattered if and only if .


If is even, then for the matrix has rank two and is not scattered.

Suppose now . Then consider such that . So and, by direct checking,

and is not scattered.

Assume and suppose that is not scattered. Then there exists such that





is a root of , and of the polynomials inductively defined by

One obtains a set of twelve equations in having a nonempty zero set. The following arguments are based on the fact that taking the resultant of two polynomials in with respect to any variable, the equations admit the same solutions.

We have


Consider the following resultants:

They all must be zero, as well as


We distinguish a number of cases.

  1. Suppose that . Since , . So

    and the resultant between and with respect to is and then (2.3) is not a root of , a contradiction.

  2. Condition is clearly equivalent to . This means that , . Therefore, by (2.4) we get and we proceed as above.

  3. Case . In this case , , , , and therefore and we can proceed as above.

  4. Condition implies and so and . By substituting in and ,

    Eliminating from these two equations one gets

    and so . We proceed as in the previous cases.

This proves that such does not exist and the assertion follows. ∎

2.2. Case 2

We apply the same methods of Section 2.1. In the following preparatory lemmas (and in the rest of the paper) is a power of an arbitrary prime .

Lemma 2.3.

Let be such that , . Then

  1. ;

  2. ;

  3. , if is odd;

  4. implies and or , , .


The first three are easy computations. Consider now

If the equation above implies .

Assume now . Since , it is equivalent to

that is . Let . Note that belongs to . We distinguish two cases.

  • . Then

    a contradiction if . Also, , is an even power of , and .

  • . Then

    a contradiction if .

Lemma 2.4.

Let be such that , . If a root of the polynomial

belongs to then one of the following cases occurs:

  • , ; or

  • , , ; or

  • ; or

  • .


First, note that would imply which is impossible by Lemma 2.3. Therefore and , where

Since , in particular

The claim follows from Lemma 2.3. ∎

Lemma 2.5.

Let be such that , . If a root of the polynomial

belongs to then


If then , a contradiction to Lemma 2.3. So we can suppose . Then

So, . ∎

Let be such that , . By Theorem 2.1 the polynomial

is scattered if and only if for each the determinant of the following two matrices do not vanish at the same time

Theorem 2.6.

Let , , be such that . Then the polynomial is not scattered.


Consider . So,

By direct checking, in this case, both and therefore is not scattered. ∎

Theorem 2.7.

Let , , , be such that and . Then the polynomial is scattered.


First we note that since is odd, , and . Suppose that is not scattered. Then for some . Consider

With a procedure similar to the one in the proof of Theorem 2.2, we will compute resultants starting from the polynomials associated with , , and . Eliminating using and using , one gets from