AGAlessandro Giannoni

Alessandro Giannoni

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Alessandro Giannoni has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Generalizing a family of scattered quadrinomials in $\mathbb {F}_{q^{2t}}[X]$

    by Alessandro Giannoni, Giovanni Giuseppe Grimaldi, Giovanni Longobardi, Marco Timpanella

    In recent years, several efforts have focused on identifying new families of scattered polynomials. Currently, only three families in $$\mathbb {F}_{q^n}[X]$$ are known to exist for infinitely many values of n and q : (i) pseudoregulus-type monomials, (ii) Lunardon–Polverino-type binomials, and (iii) a family of quadrinomials studied in a series of papers. In this work, we provide sufficient conditions under which these quadrinomials, denoted by $$\psi _{m,h,s}$$ , are scattered. Our results both include and generalize those obtained in previous studies. We also investigate the equivalences between the previously known families of scattered polynomials and those in this new class.


  • Open Access

    Long QMDS additive code

    by Daniele Bartoli, Alessandro Giannoni, Giuseppe Marino, Yue Zhou

    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.

  • Open Access

    Towards the classification of scattered binomials

    by Daniele Bartoli, Francesco Ghiandoni, Alessandro Giannoni, Giuseppe Marino

    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.

  • Open Access

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

    by Daniele Bartoli, Francesco Ghiandoni, Alessandro Giannoni, Giuseppe Marino


  • Open Access

    New scattered subspaces in higher dimensions

    by Daniele Bartoli, Alessandro Giannoni, Giuseppe Marino

    Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context, scattered sequences extend the concept of scattered polynomials and can be viewed as geometric equivalents of exceptional MRD codes. Up to now, only scattered sequences of orders one and two have been developed. However, this paper presents an infinite series of exceptional scattered sequences of any order beyond two which correspond to scattered subspaces that cannot be obtained as direct sum of scattered subspaces in smaller dimensions. The paper also addresses equivalence concerns within this framework.


  • Open Access

    New scattered subspaces in higher dimensions

    by D. Bartoli, A. Giannoni, G. Marino

    Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context, scattered sequences extend the concept of scattered polynomials and can be viewed as geometric equivalents of exceptional MRD codes. Up to now, only scattered sequences of orders one and two have been developed. However, this paper presents an infinite series of exceptional scattered sequences of any order beyond two which correspond to scattered subspaces that cannot be obtained as direct sum of scattered subspaces in smaller dimensions. The paper also addresses equivalence concerns within this framework.