Giuseppe Marino
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Giuseppe Marino has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Daniele Bartoli
Department of Mathematics and Informatics, University of Perugia, Perugia, Italy
17 shared publications - Antonio Cossidente
Università degli Studi della Basilicata
13 shared publications - Francesco Pavese
Politecnico di Bari
11 shared publications - Rocco Trombetti
Dipartimento di Mathematica e Applicazioni "R. Caccioppoli" Università degli Studi di Napoli "Federico II" I-80126 Napoli Italy
8 shared publications - Olga Polverino
Dipartimento di Matematica e Fisica, Università degli Studi della Campania “Luigi Vanvitelli”, Caserta, Italy
7 shared publications - Bence Csajbók
Dipartimento di Tecnica e Gestione dei Sistemi Industriali, Università di Padova, Vicenza, Italy
6 shared publications
Latest Publications
- Open Access
- 10 September 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (5) , 31
Multisets Meeting Lines in 0 Modulo p Points and an Improvement of the Bagchi-Inamdar Bound
The p -ary code associated with the incidence structure of points and t -spaces in a projective space $${{\,\mathrm{{PG}}\,}}(m,q)$$ , where $$q=p^h$$ , is the $${\mathbb {F}}_p$$ -subspace generated by the incidence vectors of the blocks of this design. The dual of this code consists of all vectors orthogonal to every codeword of the original code. The minimum weight of this dual code has been studied since the 1970s; the currently best known lower bound is from 2002 by Bagchi and Inamdar. In this paper we provide a substantial improvement of this bound in the case when $$h>1$$ and $$m, p >2$$ . The main ingredient of the proof is a lower bound on the size of multisets of $$\textrm{AG}(m,q)$$ meeting each line in $$0 \bmod p$$ points. We prove this, by generalising the polynomial argument in [S. Ball, A. Blokhuis, A. Gács, P. Sziklai, Zs. Weiner: On linear codes whose weights and length have a common divisor, Adv. Math., 211 (2007), 94–104] from (ordinary) planar point sets to multisets in higher dimensional spaces. While the sharpness of the planar result for point sets is in general not known, we can show that our result for multisets is sharp for every $$h,m,p\ge 2$$ .- 10 September 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (5) , 31
Open AccessMultisets Meeting Lines in 0 Modulo p Points and an Improvement of the Bagchi-Inamdar Bound
The p -ary code associated with the incidence structure of points and t -spaces in a projective space $${{\,\mathrm{{PG}}\,}}(m,q)$$ , where $$q=p^h$$ , is the $${\mathbb {F}}_p$$ -subspace generated by the incidence vectors of the blocks of this design. The dual of this code consists of all vectors orthogonal to every codeword of the original code. The minimum weight of this dual code has been studied since the 1970s; the currently best known lower bound is from 2002 by Bagchi and Inamdar. In this paper we provide a substantial improvement of this bound in the case when $$h>1$$ and $$m, p >2$$ . The main ingredient of the proof is a lower bound on the size of multisets of $$\textrm{AG}(m,q)$$ meeting each line in $$0 \bmod p$$ points. We prove this, by generalising the polynomial argument in [S. Ball, A. Blokhuis, A. Gács, P. Sziklai, Zs. Weiner: On linear codes whose weights and length have a common divisor, Adv. Math., 211 (2007), 94–104] from (ordinary) planar point sets to multisets in higher dimensional spaces. While the sharpness of the planar result for point sets is in general not known, we can show that our result for multisets is sharp for every $$h,m,p\ge 2$$ . - Open Access
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 Hammingmetric 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.
Open AccessLinear 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 Hammingmetric 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.
- Open Access
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$.Open AccessZeros 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$. - Open Access
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.Open AccessLong 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. - Open Access
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.
Open AccessLinear 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.
- Open Access
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.Open AccessTowards 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. - Open Access
- 18 January 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 103
A new family of 2-scattered subspaces and related MRD codes
- 18 January 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 103
Open AccessA new family of 2-scattered subspaces and related MRD codes
- 7 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 38 (4) , 2578-2598
Short Rank-Metric Codes and Scattered Subspaces
By exploiting the connection between scattered [Formula: see text]-subspaces of [Formula: see text] and minimal nondegenerate 3-dimensional rank-metric codes of [Formula: see text], [Formula: see text], described in [ G. N. Alfarano et al., J. Combin. Theory Ser. A, 192 (2022), 105658 ], we will exhibit a new class of codes with parameters [Formula: see text] for infinite values of [Formula: see text] and [Formula: see text] odd. Moreover, by studying the geometric structures of these scattered subspaces, we determine the rank weight distribution of the associated codes.
- 7 October 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 38 (4) , 2578-2598
Short Rank-Metric Codes and Scattered Subspaces
By exploiting the connection between scattered [Formula: see text]-subspaces of [Formula: see text] and minimal nondegenerate 3-dimensional rank-metric codes of [Formula: see text], [Formula: see text], described in [ G. N. Alfarano et al., J. Combin. Theory Ser. A, 192 (2022), 105658 ], we will exhibit a new class of codes with parameters [Formula: see text] for infinite values of [Formula: see text] and [Formula: see text] odd. Moreover, by studying the geometric structures of these scattered subspaces, we determine the rank weight distribution of the associated codes.
- Open Access
- 7 October 2024
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 204 (2) , 815-834
New scattered subspaces in higher dimensions
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.
- 7 October 2024
- Published by Springer Nature in Annali di Matematica Pura ed Applicata (1923 -)
- Vol. 204 (2) , 815-834
Open AccessNew scattered subspaces in higher dimensions
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
- 13 August 2024
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 56 (11) , 3300-3315
On the maximum field of linearity of linear sets
Let denote an ‐dimensional ‐vector space. For an ‐dimensional ‐subspace of , assume that for each nonzero vector . If , then we prove the existence of an integer such that the set of one‐dimensional ‐subspaces generated by nonzero vectors of is the same as the set of one‐dimensional ‐subspaces generated by nonzero vectors of . If we view as a point set of , it means that and determine the same set of directions. We prove a stronger statement when . In terms of linear sets, it means that an ‐linear set of has maximum field of linearity only if it has a point of weight one. We also present some consequences regarding the size of a linear set.
- 13 August 2024
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 56 (11) , 3300-3315
Open AccessOn the maximum field of linearity of linear sets
Let denote an ‐dimensional ‐vector space. For an ‐dimensional ‐subspace of , assume that for each nonzero vector . If , then we prove the existence of an integer such that the set of one‐dimensional ‐subspaces generated by nonzero vectors of is the same as the set of one‐dimensional ‐subspaces generated by nonzero vectors of . If we view as a point set of , it means that and determine the same set of directions. We prove a stronger statement when . In terms of linear sets, it means that an ‐linear set of has maximum field of linearity only if it has a point of weight one. We also present some consequences regarding the size of a linear set.