Searcharxiv⌕ Search

arXiv subjects

Olga Polverino

Publications and source records attributed to Olga Polverino.

32 records · Page 2Linked to original sources

On certain linearized polynomials with high degree and kernel of small dimension

Let $f$ be the $\mathbb{F}_q$-linear map over $\mathbb{F}_{q^{2n}}$ defined by $x\mapsto x+ax^{q^s}+bx^{q^{n+s}}$ with $\gcd(n,s)=1$. It is known that the kernel of $f$ has dimension at most $2$, as proved by Csajbók et al. in "A new family of MRD-codes" (2018). For $n$ big enough, e.g. $n\geq5$ when $s=1$, we classify the values of $b/a$ such that the kernel of $f$ has dimension at most $1$. To this aim, we translate the problem into the study of some algebraic curves of small degree with respect to the degree of $f$; this allows to use intersection theory and function field theory together with the Hasse-Weil bound. Our result implies a non-scatteredness result for certain high degree scattered binomials, and the asymptotic classification of a family of rank metric codes.

math.CO↗

Connections between scattered linear sets and MRD-codes

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 $\mathrm{PG}(1,q^n)$ define square MRD-codes. Later in "Maximum scattered linear sets and MRD-codes" (2017) maximum scattered linear sets in $\mathrm{PG}(r-1,q^n)$, $r>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 $\mathrm{PG}(n,q)$" (2000).

math.CO↗

Linear sets from projection of Desarguesian spreads

Every linear set in a Galois space is the projection of a subgeometry, and most known characterizations of linear sets are given under this point of view. For instance, scattered linear sets of pseudoregulus type are obtained by considering a Desarguesian spread of a subgeometry and projecting from a vertex which is spanned by all but two director spaces. In this paper we introduce the concept of linear sets of $h$-pseudoregulus type, which turns out to be projected from the span of an arbitrary number of director spaces of a Desarguesian spread of a subgeometry. Among these linear sets, we characterize those which are $h$-scattered and solve the equivalence problem between them; a key role is played by an algebraic tool recently introduced in the literature and known as Moore exponent set. As a byproduct, we classify asymptotically $h$-scattered linear sets of $h$-pseudoregulus type.

math.CO↗

A characterization of linearized polynomials with maximum kernel

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these polynomials have maximum kernel. As an application we study in detail $q$-polynomials of degree $q^{n-2}$ over $\mathbb{F}_{q^n}$ which have maximum kernel and for $n\leq 6$ we list all $q$-polynomials with maximum kernel. We also obtain information on the splitting field of an arbitrary $q$-polynomial. Analogous results are proved for $q^s$-polynomials as well, where $\gcd(s,n)=1$.

math.CO↗

A Carlitz type result for linearized polynomials

For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient and necessary conditions and then apply our result to study maximum scattered linear sets of $\mathrm{PG}(1,q^5)$.

math.CO↗

A new family of MRD-codes

We introduce a family of linear sets of $\mathrm{PG}(1,q^{2n})$ arising from maximum scattered linear sets of pseudoregulus type of $\mathrm{PG}(3,q^{n})$. For $n=3,4$ and for certain values of the parameters we show that these linear sets of $\mathrm{PG}(1,q^{2n})$ are maximum scattered and they yield new MRD-codes with parameters $(6,6,q;5)$ for $q>2$ and with parameters $(8,8,q;7)$ for $q$ odd.

math.CO↗

Maximum scattered linear sets and MRD-codes

The rank of a scattered $\mathbb{F}_q$-linear set of $\mathrm{PG}(r-1,q^n)$, $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 $\mathbb{F}_q$-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 $\mathbb{F}_q$-linear sets of $\mathrm{PG}(1,q^n)$ of maximum rank $n$ yield $\mathbb{F}_q$-linear MRD-codes with dimension $2n$ and minimum distance $n-1$. We generalize this result and show that scattered $\mathbb{F}_q$-linear sets of $\mathrm{PG}(r-1,q^n)$ of maximum rank $rn/2$ yield $\mathbb{F}_q$-linear MRD-codes with dimension $rn$ and minimum distance $n-1$.

math.CO↗

Classes and equivalence of linear sets in $PG(1,q^n)$

The equivalence problem of $\mathbb{F}_q$-linear sets of rank n of $PG(1,q^n)$ is investigated, also in terms of the associated variety, projecting configurations, $\mathbb{F}_q$-linear blocking sets of Rédei type and MRD-codes.

math.CO↗

Codes arising from incidence matrices of points and hyperplanes in $PG(n,q)$

In this paper we completely characterize the words with second minimum weight in the $p-$ary linear code generated by the rows of the incidence matrix of points and hyperplanes of $PG(n,q)$, with $q=p^h$ and $p$ prime, proving that they are the scalar multiples of the difference of the incidence vectors of two distinct hyperplanes of $PG(n,q)$.

math.CO↗

Maximum scattered linear sets and complete caps in Galois spaces

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in $AG(r,2^t)$ fixed by a translation group of size $2^{\frac{rt}2}$. The doubling construction applied to such caps gives complete caps in $AG(r+1,2^t)$ of size $2^{\frac{rt}2+1}$. For Galois spaces of even dimension greater than $2$ and even square order, this solves the long-standing problem of establishing whether the theoretical lower bound for the size of a complete cap is substantially sharp.

math.CO↗

The isotopism problem of a class of 6-dimensional rank 2 semifields and its solution

In [U. Dempwolff: \textit{More Translation Planes and Semifields from Dembowski-Ostrom Polynomials}, Designs, Codes, Cryptogr. \textbf{68} (1-3) (2013), 81--103] three classes of rank two presemifields of order $q^{2n}$, with $q$ and $n$ odd, were exhibited, leaving as an open problem the isotopy issue. In [M. Lavrauw, G. Marino, O. Polverino, R. Trombetti: \textit{Solution to an isotopism question concerning rank 2 semifields}, J. Comb. Des., to appear. DOI: 10.1002/jcd.21382], the authors faced with this problem answering the question whether these presemifields are new for $n>3$. In this paper we complete the study solving the case $n=3$.

math.CO↗

Solution to an isotopism question concerning rank 2 semifields

In [U. Dempwolff: More Translation Planes and Semifields from Dembowski-Ostrom Polynomials, Designs, Codes, Cryptogr. \textbf{68} (1-3) (2013), 81-103], the author gives a construction of three classes of rank two semifields of order $q^{2n}$, with $q$ and $n$ odd, using Dembowski-Ostrom polynomials. The question whether these semifields are new, i.e. not isotopic to previous constructions, is left as an open problem. In this paper we solve this problem for $n>3$, in particular we prove that two of these classes, labeled $D_{A}$ and $D_{AB}$, are new for $n>3$, whereas presemifields in family $D_{B}$ are isotopic to Generalized Twisted Fields for each $n\geq 3$.

math.CO↗

On the nuclei of a finite semifield

In this paper we collect and improve the techniques for calculating the nuclei of a semifield and we use these tools to determine the order of the nuclei and of the center of some commutative presemifields of odd characteristic recently constructed.

math.CO↗

On isotopisms and strong isotopisms of commutative presemifields

In this paper we prove that the $P(q,\ell)$ ($q$ odd prime power and $\ell>1$ odd) commutative semifields constructed by Bierbrauer in \cite{BierbrauerSub} are isotopic to some commutative presemifields constructed by Budaghyan and Helleseth in \cite{BuHe2008}. Also, we show that they are strongly isotopic if and only if $q\equiv 1(mod\,4)$. Consequently, for each $q\equiv -1(mod\,4)$ there exist isotopic commutative presemifields of order $q^{2\ell}$ ($\ell>1$ odd) defining CCZ--inequivalent planar DO polynomials.

math.CO↗