Searcharxiv⌕ Search

arXiv subjects

Daniele Bartoli

Publications and source records attributed to Daniele Bartoli.

At least 19 recordsLinked to original sources

On the hull of linearized polynomial codes

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of $\mathbb{F}_q$-linear codes defined by $q$-polynomial operators over $\mathbb{F}_{q^m}$. Our main tool is a unified Gram-matrix method. For image codes $\mathcal{C}(\boldsymbolα)=\operatorname{im}Φ_{\boldsymbolα}$, with $Φ_{\boldsymbolα}=\sum_iα_iF_i$, we prove the master hull--rank formula $\dim\operatorname{Hull}(\mathcal{C}(\boldsymbolα))=\operatorname{rank}(Φ_{\boldsymbolα})-\operatorname{rank}(G(\boldsymbolα))$, where $G(\boldsymbolα)$ is the associated Gram matrix over $\mathbb{F}_q$. Specializing to $C_{λ,μ}=\operatorname{im}(λx+μL(x))$, we obtain a quadratic Gram pencil $λ^2G_0+λμG_1+μ^2G_2$ whose determinant describes the LCD locus in $\mathbb{P}^1(\mathbb{F}_q)$. We also treat $\mathbb{F}_{q^m}$-linear rank-distance codes $\mathcal{C}=\langle X,F_1,\ldots,F_k\rangle_{\mathbb{F}_{q^m}}$ with the Delsarte inner product, where a $k\times k$ Gram matrix over $\mathbb{F}_{q^m}$ determines the hull dimension. For $L(X)=X^{q^k}$, with $d=\gcd(k,m)$, the resulting circulant Gram matrices yield a closed-form discriminant and a complete classification in three of the four bijectivity configurations over $\mathbb{P}^1(\mathbb{F}_{q^m})$. In the remaining case, the hull dimension equals $δ=\dim_{\mathbb{F}_q}(\operatorname{im}ϕ_{λ,μ}\cap\kerϕ_{λ,μ}^{\dagger})$, and the extremal condition $δ=d$ is characterized by an explicit trace-isotropy criterion. We conclude with an exact count of LCD and non-LCD points, showing that the LCD density tends to $1$ as $q\to\infty$, together with a worked example over $\mathbb{F}_{64}$ and a SageMath verification.

cs.IT↗

Reduced polynomial lifts of APN permutations over Galois rings and effective non-APN bounds

We clarify the APN lifting conjecture over Galois rings of Rønjom and Sandrib (CCDS, 2026). A function on $\F_q$ has many polynomial representatives, whose formal derivatives may differ, so the conjecture must use the unique reduced representative of degree less than $q$; without this normalization, it is false. The standard permutation-polynomial criterion over Galois rings then gives an exact reduction: the reduced representative $f$ of an APN permutation lifts to a permutation of $\GR(2^k,m)$, $k>1$, if and only if $f'(x)\ne0$ for every $x\in\F_{2^m}$. Thus the corrected lifting conjecture is equivalent to a finite-field critical-point conjecture. We next use Janwa--Wilson--Rodier surfaces, which encode the APN condition by rational points off the diagonal arrangement, to prove an effective nonexistence result. For every odd degree $d\ge5$ outside the Gold exponents $2^r+1$ and Kasami--Welch exponents $2^{2r}-2^r+1$, results of Hernando--McGuire and Aubry--McGuire--Rodier provide an absolutely irreducible factor in the hyperplane section at infinity. This yields an absolutely irreducible component of the surface, defined over the ground field and not contained in the diagonal arrangement. The explicit Cafure--Matera estimate then gives a computable number $\APNmzero{d}$ such that no polynomial of degree $d$ over $\F_{2^m}$ is APN when $m\ge\APNmzero{d}$. The qualitative eventual non-APN result is due to Aubry--McGuire--Rodier; our contribution is the explicit threshold. A direct identity for difference tables also gives an even-degree consequence: if $g$ has such an odd degree, then $ax+g(x^2)+c$, with $a\ne0$, has the same differential uniformity as $g$ and is therefore not APN in the same explicit range. Finally, we prove directly that every cubic permutation polynomial has a rational critical point and hence satisfies the corrected lifting conjecture.

math.NT↗

An infinite family of non-extendable MRD codes

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one while preserving its optimality. This work investigates $\mathbb{F}_{q^m}$-linear MRD codes that are non-extendable but do not attain the maximum possible length. Geometrically, these correspond to scattered subspaces with respect to hyperplanes that are maximal with respect to inclusion but not of maximum dimension. By exploiting this geometric connection, we introduce the first infinite family of non-extendable $[4,2,3]_{q^5/q}$ MRD codes. Furthermore, we prove that these codes are self-dual up to equivalence.

cs.IT↗

Infinite families of APN permutations in constrained trivariate classes over $\mathbb{F}_{2^m}$

We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li--Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[ G_a(x,y,z)=(x^{q+1}+ax^qz+yz^q,\; x^qz+y^{q+1},\; xy^q+ay^qz+z^{q+1}), \] where $a\in\mathbb{F}_{2^m}^*$, $q=2^i$, $\gcd(i,m)=1$, and $m$ is odd, we prove that $G_a$ is a permutation if and only if an associated univariate polynomial has no root in $\mathbb{F}_{2^m}^*$, and that this condition is also equivalent to $G_a$ being APN. Hence, writing $d=q^2+q+1$, at least \[ \frac{2^m+1-(d-1)(d-2)2^{m/2}-d}{d} \] values of $a$ yield APN permutations $G_a$. In the binary case $q=2$, we show that $a=1$ is good whenever $7\nmid m$, recovering the Li--Kaleyski family. For the second family \[ H_a(x,y,z)=(x^{q+1}+axy^q+yz^q,\; xy^q+z^{q+1},\; x^qz+y^{q+1}+ay^qz), \] we obtain the same root criterion and prove that its defining polynomial is root-equivalent to that of $G_a$. Thus the same parameters $a$ give APN permutations in both families. We also prove strong inequivalence results. First, $G_a$ (resp.\ $H_a$) is diagonally equivalent to $G_1$ (resp.\ $H_1$) if and only if $a^{q^2+q+1}=1$; moreover, for $m>4$, $m\neq 6$, and $7\nmid m$, diagonal non-equivalence implies CCZ non-equivalence by the monomial restriction theorem of Shi et al.\ (DCC, 2025). In particular, when $q=2$ and $7\nmid m$, every good $a\neq 1$ gives APN permutations CCZ-inequivalent to Li--Kaleyski. Second, for the same range of $m$, no $G_a$ is CCZ-equivalent to any $H_b$. Hence these constructions yield two genuinely new, mutually inequivalent families of APN permutations on $\mathbb{F}_{2^{3m}}$.

math.NT↗

Non-permutation phenomena in trivariate families over $\F_{2^m}$ and resolution of a conjecture

Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE Trans. Inf. Theory, 2024) generalized two sporadic quadratic APN permutations into infinite families of trivariate functions. Motivated by their work, we investigate conditions under which generalized trivariate functions fail to be permutations. We establish necessary conditions on coefficient parameters that prevent the permutation property, provide a complete computational classification for small field extensions, and prove general non-permutation results. As a key application of our algebraic geometry approach, we resolve the permutation part of a conjecture by Beierle, Carlet, Leander, and Perrin (Finite Fields Appl., 2022) regarding a related trivariate form. Specifically, we prove that for all odd characteristic-2 extension degrees $m \geq 23$, their function $C_u$ is not a permutation over $\mathbb{F}_{2^m}^3$ for any $u \in \mathbb{F}_{2^m}^*$, resolving the permutation part of their conjecture for sufficiently large fields.

math.NT↗

On the Classification of Dillon's APN Hexanomials

We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results. For functions over $\mathbb{F}_{q^2}$, where $q=2^n$, of the form \[ F(x)=x(Ax^2+Bx^q+Cx^{2q})+x^2(Dx^q+Ex^{2q})+x^{3q}, \] we derive necessary conditions on the coefficients $A,B,C,D,E$ for APNness using algebraic number theory and algebraic-geometry methods over finite fields. Our main contribution is a comprehensive case-by-case analysis that excludes large classes of Dillon hexanomials via vanishing patterns of key coefficient polynomials. We identify algebraic obstructions -- including absolutely irreducible components of associated varieties and degree incompatibilities in polynomial factorizations -- that prevent these functions from attaining optimal differential uniformity. These results substantially narrow the search space for new APN functions in this family and provide a framework applicable to other APN candidates. We complement the theory with extensive computations: exhaustive searches over $\mathbb{F}_{2^2}$ and $\mathbb{F}_{2^4}$, and random sampling over $\mathbb{F}_{2^6}$ and $\mathbb{F}_{2^8}$, yielding hundreds of APN hexanomials. Complete CCZ-equivalence testing shows that, although many examples occur, they fall into few distinct classes. For $q\in\{2,4\}$, all examples are CCZ-equivalent to the Budaghyan--Carlet family, while in larger dimensions none appear equivalent to that family.

math.NT↗

Zeros of special polynomials and their impact on a class of APN functions

In 2021, Calderini et al. introduced a construction for APN functions on $\mathbb{F}_{2^{2m}}$ in bivariate form $$ f(x,y)=\big(xy,\, x^{2^r+1} + x^{2^{r+m/2}} y^{2^{m/2}} + bxy^{2^r} + cy^{2^r+1}\big),\quad r < m/2,\quad \gcd(r, m) = 1. $$ They showed that this family exists provided the existence of a polynomial $$ P_{c,b}(X)=(cX^{2^r +1} + b X^{2^r}+1)^{2^{m/2}+1}+X^{2^{m/2}+1}, $$ with no zeros in $\mathbb{F}_{2^{2m}}$. For $m\le 6$ it was shown that we can have APN functions belonging to this family. However, up to now, no construction of such polynomials is known for $m\ge 8$. In this work we provide a non-existence result of such functions whenever $r<m/8-1$, by application of techniques from algebraic varieties over finite fields. In particular, for $r=1$ we have that the construction of Calderini et al. cannot provide an APN function for $m\ge 8$.

math.NT↗

Long QMDS additive code

We investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the minimum Hamming distance and the normalized dimension $r/h$ may be fractional. A central object of interest is the class of quasi-MDS (QMDS) codes, those additive codes achieving the generalized Singleton bound: $$ d = n - \left\lceil \frac{r}{h} \right\rceil + 1. $$ In this work, we construct explicit families of additive QMDS codes whose lengths exceed those of the best-known $\mathbb{F}_{q^h}$-linear MDS codes which is $q^h+1$, and we will call these types of codes ``Long'' . By leveraging $\mathbb{F}_q$-linearity and geometric tools like partial spreads and dimensional dual arcs, we show that additive structures allow longer codes without sacrificing optimality in distance. We also examine dual codes and give conditions under which the QMDS property is preserved under duality.

math.CO↗

Linear rank-metric intersecting codes

In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said to be intersecting if any two nonzero codewords have supports intersecting non trivially. We explore this class from both a coding-theoretic and geometric perspective, highlighting its relationship with minimal codes, MRD codes, and Hamming-metric intersecting codes. We derive structural properties, sufficient conditions based on minimum distance, and geometric characterizations in terms of 2-spannable $q$-systems. We establish upper and lower bounds on code parameters and show some constructions, which leave a range of unexplored parameters. Finally, we connect rank-intersecting codes to other combinatorial structures such as $(2,1)$-separating systems and frameproof codes.

math.CO↗

On APN functions in odd characteristic, the disproof of a conjecture and related problems

In this paper disprove a conjecture by Pal and Budaghyan (DCC, 2024) on the existence of a family of APN permutations, but showing that if the field's cardinality $q$ is larger than~$9587$, then those functions will never be APN. Moreover, we discuss other connected families of functions, for potential APN functions, but we show that they are not good candidates for APNess if the underlying field is large, in spite of the fact that they though they are APN for small environments.

math.AG↗

Towards the classification of scattered binomials

Let \( q \) be a prime power and \( n \) an integer. An \( \mathbb{F}_q \)-linearized polynomial \( f \) is said to be scattered if it satisfies the condition that for all \( x, y \in \mathbb{F}_q^n \setminus \{ 0 \} \), whenever \( \frac{f(x)}{x} = \frac{f(y)}{y} \), it follows that \( \frac{x}{y} \in \mathbb{F}_q \). In this paper, we focus on scattered binomials. Two families of scattered binomials are currently known: the one from Lunardon and Polverino (LP), given by $f(x) = δx^{q^s} + x^{q^{n-s}},$ and the one from Csajbók, Marino, Polverino, and Zanella (CMPZ), given by $f(x) = δx^{q^s} + x^{q^{s + n/2}},$ where \( n = 6 \) or \( n = 8 \). Using algebraic varieties as a tool, we prove some necessary conditions for a binomial to be scattered. As a corollary, we obtain that when \( q \) is sufficiently large and \( n \) is prime, a binomial is scattered if and only if it is of the form (LP). Moreover we obtain a complete classification of scattered binomial in $\Fn$ when $n\leq8$ and $q$ is large enough.

math.CO↗

Ovoids of $Q^+(7,q)$ of low-degree

Ovoids of the hyperbolic quadric $Q^+(7,q)$ of $\mathrm{PG}(7,q)$ have been extensively studied over the past 40 years, partly due to their connections with other combinatorial objects. It is well known that the points of an ovoid of $Q^+(7,q)$ can be parametrized by three polynomials $f_1(X,Y,Z)$, $f_2(X,Y,Z)$, $f_3(X,Y,Z)$. In this paper, we classify ovoids of $Q^+(7,q)$ of low degree, specifically under the assumption that $f_1(X,Y,Z)$, $f_2(X,Y,Z)$, $f_3(X,Y,Z)$ have degree at most 3. Our approach relies on the analysis of an algebraic hypersurface associated with the ovoid.

math.CO↗

A proof of a conjecture on permutation trinomials

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +αX^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$, from [A. Rai, R. Gupta, {\it Further results on a class of permutation trinomials}, Cryptogr. Commun. 15 (2023), 811--820].

math.NT↗

Scattered trinomials of $\mathbb{F}_{q^6}[X]$ in even characteristic

In recent years, several families of scattered polynomials have been investigated in the literature. However, most of them only exist in odd characteristic. In [B. Csajbók, G. Marino and F. Zullo: New maximum scattered linear sets of the projective line, Finite Fields Appl. 54 (2018), 133-150; G. Marino, M. Montanucci and F. Zullo: MRD-codes arising from the trinomial $x^q+x^{q^3}+cx^{q^5}\in\mathbb{F}_{q^6}[x]$, Linear Algebra Appl. 591 (2020), 99-114], the authors proved that the trinomial $f_c(X)=X^{q}+X^{q^{3}}+cX^{q^{5}}$ of $\mathbb{F}_{q^6}[X]$ is scattered under the assumptions that $q$ is odd and $c^2+c=1$. They also explicitly observed that this is false when $q$ is even. In this paper, we provide a different set of conditions on $c$ for which this trinomial is scattered in the case of even $q$. Using tools of algebraic geometry in positive characteristic, we show that when $q$ is even and sufficiently large, there are roughly $q^3$ elements $c \in \mathbb{F}_{q^6}$ such that $f_{c}(X)$ is scattered. Also, we prove that the corresponding MRD-codes and $\mathbb{F}_q$-linear sets of $\mathrm{PG}(1,q^6)$ are not equivalent to the previously known ones.

math.CO↗

A new infinite family of maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(m(h+1),q^n)$ and associated MRD codes

The exploration of linear subspaces, particularly scattered subspaces, has garnered considerable attention across diverse mathematical disciplines in recent years, notably within finite geometries and coding theory. Scattered subspaces play a pivotal role in analyzing various geometric structures such as blocking sets, two-intersection sets, complete arcs, caps in affine and projective spaces over finite fields and rank metric codes. This paper introduces a new infinite family of $h$-subspaces, along with their associated MRD codes. Additionally, it addresses the task of determining the generalized weights of these codes. Notably, we demonstrate that these MRD codes exhibit some larger generalized weights compared to those previously identified.

math.CO↗

On $3$-dimensional MRD codes of type $\langle x^{q^t},x+δx^{q^{2t}},G(x) \rangle$

In this work we present results on the classification of $\mathbb{F}_{q^n}$-linear MRD codes of dimension three. In particular, using connections with certain algebraic varieties over finite fields, we provide non-existence results for MRD codes $\mathcal{C}=\langle x^{q^t}, F(x), G(x) \rangle \subseteq \mathcal{L}_{n,q}$ of exceptional type, i.e. such that $\mathcal{C}$ is MRD over infinite many extensions of the field $\mathbb{F}_{q^n}$. These results partially address a conjecture of Bartoli, Zini and Zullo in 2023.

cs.IT↗

A new family of $2$-scattered subspaces and related MRD codes

Scattered subspaces and $h$-scattered subspaces have been extensively studied in recent decades for both theoretical purposes and their connections to various applications. While numerous constructions of scattered subspaces exist, relatively few are known about $h$-scattered subspaces with $h\geq2$. In this paper, we establish the existence of maximum $2$-scattered $\F_q$-subspaces in $V(r,q^6)$ whenever $r\geq 3$, $r\ne 5$, and $q$ is an odd power of $2$. Additionally, we explore the corresponding MRD codes.

math.CO↗

On the classification of low degree ovoids of $Q^+(5,q)$

Ovoids of the Klein quadric $Q^+(5,q)$ of $\mathrm{PG}(5,q)$ have been studied in the last 40 year, also because of their connection with spreads of $\mathrm{PG}(3,q)$ and hence translation planes. Beside the classical example given by a three dimensional elliptic quadric (corresponding to the regular spread of $\mathrm{PG}(3,q)$) many other classes of examples are known. First of all the other examples (beside the elliptic quadric) of ovoids of $Q(4,q)$ give also examples of ovoids of $Q^+(5,q)$. Another important class of ovoids of $Q^+(5,q)$ is given by the ones associated to a flock of a three dimensional quadratic cone. To every ovoid of $Q^+(5,q)$ two bivariate polynomials $f_1(x,y)$ and $f_2(x,y)$ can be associated. In this paper, we classify ovoids of $Q^+(5,q)$ such that $f_1(x,y)=y+g(x)$ and $\max\{deg(f_1),deg(f_2)\}<(\frac{1}{6.3}q)^{\frac{3}{13}}-1$, that is $f_1(x,y)$ and $f_2(x,y)$ have "low degree" compared with $q$.

math.CO↗