194 results on '"Zullo, Ferdinando"'
Search Results
2. On perfect symmetric rank-metric codes
- Author
-
Mushrraf, Usman and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering properties of symmetric rank-metric codes. First we characterize symmetric rank-metric codes which are perfect, i.e. that satisfy the equality in the sphere-packing like bound. We show that, despite the rank-metric case, there are non trivial perfect codes. Also, we characterize families of codes which are quasi-perfect.
- Published
- 2024
3. Full weight spectrum one-orbit cyclic subspace codes
- Author
-
Castello, Chiara, Polverino, Olga, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we will focus on the analogous class of codes within the framework of cyclic subspace codes. Cyclic subspace codes have garnered significant attention, particularly for their applications in random network coding to correct errors and erasures. We investigate one-orbit cyclic subspace codes that are full weight spectrum in this context. Utilizing number theoretical results and combinatorial arguments, we provide a complete classification of full weight spectrum one-orbit cyclic subspace codes.
- Published
- 2024
4. Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
- Author
-
Ozbudak, Ferruh, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches using combinatorial and additive (character sum) structures of finite fields. Consequently, we immediately obtain new classes of optical orthogonal codes with different parameters.
- Published
- 2024
5. Two-weight rank-metric codes
- Author
-
Zullo, Ferdinando, Polverino, Olga, Santonastaso, Paolo, and Sheekey, John
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association schemes, strongly regular graphs, and secret sharing schemes. In this paper, we characterize two-weight codes in the rank metric, answering a recent question posed by Pratihar and Randrianarisoa., Comment: Accepted for publication in ISIT 2024
- Published
- 2024
6. On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$
- Author
-
Castello, Chiara, Polverino, Olga, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
Subspace codes have recently been used for error correction in random network coding. In this work, we focus on one-orbit cyclic subspace codes. If $S$ is an $\mathbb{F}_q$-subspace of $\mathbb{F}_{q^n}$, then the one-orbit cyclic subspace code defined by $S$ is \[ \mathrm{Orb}(S)=\{\alpha S \colon \alpha \in \mathbb{F}_{q^n}^*\}, \]where $\alpha S=\lbrace \alpha s \colon s\in S\rbrace$ for any $\alpha\in \mathbb{F}_{q^n}^*$. Few classification results of subspace codes are known, therefore it is quite natural to initiate a classification of cyclic subspace codes, especially in the light of the recent classification of the isometries for cyclic subspace codes. We consider three-dimensional one-orbit cyclic subspace codes, which are divided into three families: the first one containing only $\mathrm{Orb}(\mathbb{F}_{q^3})$; the second one containing the optimum-distance codes; and the third one whose elements are codes with minimum distance $2$. We study inequivalent codes in the latter two families., Comment: Accepted to the 2024 IEEE International Symposium on Information Theory (ISIT 2024)
- Published
- 2024
7. New scattered linearized quadrinomials
- Author
-
Smaldore, Valentino, Zanella, Corrado, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,11T71 11T06 94B05 - Abstract
Let $1
8$ only three families of scattered polynomials in $\mathbb F_{q^n}[X]$ are known: $(i)$~monomials of pseudoregulus type, $(ii)$~binomials of Lunardon-Polverino type, and $(iii)$~a family of quadrinomials defined in [1,10] and extended in [8,13]. In this paper we prove that the polynomial $\varphi_{m,q^J}=X^{q^{J(t-1)}}+X^{q^{J(2t-1)}}+m(X^{q^J}-X^{q^{J(t+1)}})\in\mathbb F_{q^{2t}}[X]$, $q$ odd, $t\ge3$ is R-$q^t$-partially scattered for every value of $m\in\mathbb F_{q^t}^*$ and $J$ coprime with $2t$. Moreover, for every $t>4$ and $q>5$ there exist values of $m$ for which $\varphi_{m,q}$ is scattered and new with respect to the polynomials mentioned in $(i)$, $(ii)$ and $(iii)$ above. The related linear sets are of $\Gamma L$-class at least two. - Published
- 2024
8. Saturating linear sets in PG$(2,q^4)$
- Author
-
Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics - Abstract
Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study \emph{$1$-saturating} linear sets in PG$(2,q^4)$, that is $\mathbb{F}_q$-linear sets in PG$(2,q^4)$ with the property that their secant lines cover the entire plane. By making use of a characterization of generalized Gabidulin codes, we prove that the rank of such a linear set is at least $5$. This answers to a recent question posed by Bartoli, Borello and Marino.
- Published
- 2024
9. On the stabilizer of the graph of linear functions over finite fields
- Author
-
Smaldore, Valentino, Zanella, Corrado, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
In this paper we will study the action of $\mathbb{F}_{q^n}^{2 \times 2}$ on the graph of an $\mathbb{F}_q$-linear function of $\mathbb{F}_{q^n}$ into itself. In particular we will see that, under certain combinatorial assumptions, its stabilizer (together with the sum and product of matrices) is a field. We will also see some examples for which this does not happen. Moreover, we will establish a connection between such a stabilizer and the right idealizer of the rank-metric code defined by the linear function and give some structural results in the case in which the polynomials are partially scattered.
- Published
- 2024
10. Constructions and equivalence of Sidon spaces
- Author
-
Castello, Chiara, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
Sidon spaces have been introduced by Bachoc, Serra and Z\'emor in 2017 as the $q$-analogue of Sidon sets. The interest on Sidon spaces has increased quickly, especially after the work of Roth, Raviv and Tamo in 2018, in which they highlighted the correspondence between Sidon spaces and cyclic subspace codes. Up to now, the known constructions of Sidon Spaces may be divided in three families: the ones contained in the sum of two multiplicative cosets of a fixed subfield of $\mathbb{F}_{q^n}$, the ones contained in the sum of more than two multiplicative cosets of a fixed subfield of $\mathbb{F}_{q^n}$ and finally the ones obtained as the kernel of subspace polynomials. In this paper we will mainly focus on the first class of examples, for which we provide characterization results and we will show some new examples, arising also from some well-known combinatorial objects. Moreover, we will give a quite natural definition of equivalence among Sidon spaces, which relies on the notion of equivalence of cyclic subspace codes and we will discuss about the equivalence of the known examples.
- Published
- 2023
11. Maximum Flag-Rank Distance Codes
- Author
-
Alfarano, Gianira N., Neri, Alessandro, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for network coding. In this setting we provide a Singleton-like bound which relates the parameters of a flag-rank-metric code. This allows us to introduce the family of maximum flag-rank distance codes, that are flag-rank-metric codes meeting the Singleton-like bound with equality. Finally, we provide several constructions of maximum flag-rank distance codes.
- Published
- 2023
12. Geometric dual and sum-rank minimal codes
- Author
-
Borello, Martino and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
The main purpose of this paper is to further study the structure, parameters and constructions of the recently introduced minimal codes in the sum-rank metric. These objects form a bridge between the classical minimal codes in the Hamming metric, the subject of intense research over the past three decades partly because of their cryptographic properties, and the more recent rank-metric minimal codes. We prove some bounds on their parameters, existence results, and, via a tool that we name geometric dual, we manage to construct minimal codes with few weights. A generalization of the celebrated Ashikhmin-Barg condition is proved and used to ensure minimality of certain constructions., Comment: 26 pages
- Published
- 2023
13. Maximum weight codewords of a linear rank metric code
- Author
-
Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
Let $\mathcal{C}\subseteq \mathbb{F}_{q^m}^n$ be an $\mathbb{F}_{q^m}$-linear non-degenerate rank metric code with dimension $k$. In this paper we investigate the problem of determining the number $M(\mathcal{C})$ of codewords in $\mathcal{C}$ with maximum weight, that is $\min\{m,n\}$, and to characterize those with the maximum and the minimum values of $M(\mathcal{C})$.
- Published
- 2023
14. Divisible linear rank metric codes
- Author
-
Polverino, Olga, Santonastaso, Paolo, Sheekey, John, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to ask whether or not all subspaces of matrices with such a property arise from a subspace of matrices over a larger field. In this paper we explore this question, which corresponds to studying divisible codes in the rank metric. We determine some cases for which this question holds true, and describe counterexamples by constructing subspaces with this property which do not arise from a subspace of matrices over a larger field.
- Published
- 2022
15. Left ideal LRPC codes and a ROLLO-type cryptosystem based on group algebras
- Author
-
Borello, Martino, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Computer Science - Cryptography and Security ,Mathematics - Rings and Algebras - Abstract
In this paper we introduce left ideal low-rank parity-check codes by using group algebras and we finally use them to extend ROLLO-I KEM., Comment: This is an extended abstract. Comments are welcome!
- Published
- 2022
16. Cones from maximum $h$-scattered linear sets and a stability result
- Author
-
Adriaensen, Sam, Mannaert, Jonathan, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,51E20, 51E21, 94B05 - Abstract
This paper mainly focuses on cones whose basis is a maximum $h$-scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we analyze two constructions of point sets with few intersection sizes with the hyperplanes. In particular, the second one extends the construction of translation KM-arcs in projective spaces, having as part at infinity a cone with basis a maximum $h$-scattered linear set. As an instance of the second construction we obtain cylinders with a hyperoval as basis, which we call hypercylinders, for which we are able to provide a stability result. The main motivation for these problems is related to the connections with both Hamming and rank distance codes. Indeed, we are able to construct codes with few weights and to provide a stability result for the codes associated with hypercylinders., Comment: 25 pages, 2 figures
- Published
- 2022
17. Clubs and their applications
- Author
-
Napolitano, Vito, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
Clubs of rank k are well-celebrated objects in finite geometries introduced by Fancsali and Sziklai in 2006. After the connection with a special type of arcs known as KM-arcs, they renewed their interest. This paper aims to study clubs of rank n in PG$(1,q^n)$. We provide a classification result for (n-2)-clubs of rank n, we analyze the $\mathrm{\Gamma L}(2,q^n)$-equivalence of the known subspaces defining clubs, for some of them the problem is then translated in determining whether or not certain scattered spaces are equivalent. Then we find a polynomial description of the known families of clubs via some linearized polynomials. Then we apply our results to the theory of blocking sets, KM-arcs, polynomials and rank metric codes, obtaining new constructions and classification results.
- Published
- 2022
18. Waring identifiable subspaces over finite fields
- Author
-
Lavrauw, Michel and Zullo, Ferdinando
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - Combinatorics ,15A69, 15A63, 14J70, 15A72, 51E20, 14N07 - Abstract
Waring's problem, of expressing an integer as the sum of powers, has a very long history going back to the 17th century, and the problem has been studied in many different contexts. In this paper we introduce the notion of a Waring subspace and a Waring identifiable subspace with respect to a projective algebraic variety $\mathcal X$. When $\mathcal X$ is the Veronese variety, these subspaces play a fundamental role in the theory of symmetric tensors and are related to the Waring decomposition and Waring identifiability of symmetric tensors (homogeneous polynomials). We give several constructions and classification results of Waring identifiable subspaces with respect to the Veronese variety in ${\mathbb{P}}^5({\mathbb{F}}_q)$ and in ${\mathbb{P}}^{9}({\mathbb{F}}_q)$, and include some applications to the theory of linear systems of quadrics in ${\mathbb{P}}^3({\mathbb{F}}_q)$.
- Published
- 2022
19. Generalised Evasive Subspaces
- Author
-
Gruica, Anina, Ravagnani, Alberto, Sheekey, John, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics - Abstract
We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and evasiveness. We establish various upper bounds for the dimension of an evasive subspace with respect to arbitrary partial spreads, obtaining improvements for the Desarguesian ones. We also establish existence results for evasive spaces in a non-constructive way, using a graph theory approach. The upper and lower bounds we derive have a precise interpretation as bounds for the critical exponent of certain combinatorial geometries. Finally, we investigate connections between the notion of evasive space we introduce and the theory of rank-metric codes, obtaining new results on the covering radius and on the existence of minimal vector rank-metric codes.
- Published
- 2022
20. On subspace designs
- Author
-
Santonastaso, Paolo and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics ,Primary 51E23, 94B05. Secondary 51E22, 05B99 - Abstract
Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design, showing they are tight via explicit constructions. We point out a connection with sum-rank metric codes, dealing with optimal codes and minimal codes with respect to this metric. Applications to two-intersection sets with respect to hyperplanes, two-weight codes, cutting blocking sets and lossless dimension expanders are also provided.
- Published
- 2022
- Full Text
- View/download PDF
21. Encoding and Decoding of Several Optimal Rank Metric Codes
- Author
-
Kadir, Wrya K., Li, Chunlei, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,12F05 ,E.4 ,E.5 ,G.2 - Abstract
This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right choice for these codes and then we provide easily reversible encoding methods for each family. Later unique decoding algorithms for the codes are described. The decoding algorithms are interpolation-based and can uniquely correct errors for each code with rank up to $\lfloor(d-1)/2\rfloor$ in polynomial-time, where $d$ is the minimum distance of the code.
- Published
- 2022
22. On the automorphism groups of Lunardon-Polverino scattered linear sets
- Author
-
Tang, Wei, Zhou, Yue, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,51E21(primary) 94B27, 11T06(secondary) - Abstract
Lunardon and Polverino introduced in 2001 a new family of maximum scattered linear sets in $\mathrm{PG}(1,q^n)$ to construct linear minimal R\'edei blocking sets. This family has been extended first by Lavrauw, Marino, Trombetti and Polverino in 2015 and then by Sheekey in 2016 in two different contexts (semifields and rank metric codes). These linear sets are called Lunardon-Polverino linear sets and this paper aims to determine their automorphism groups, to solve the equivalence issue among Lunardon-Polverino linear sets and to establish the number of inequivalent linear sets of this family. We then elaborate on this number, providing explicit bounds and determining its asymptotics., Comment: In the 2nd version, Eq.(15) in Theorem 3.2 has been corrected for even q and odd n
- Published
- 2022
23. Non-minimum tensor rank Gabidulin codes
- Author
-
Bartoli, Daniele, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an $8$-dimensional $\mathbb{F}_q$-linear generalized Gabidulin code in $\mathbb{F}_{q}^{4\times4}$. This shows that such a code is never minimum tensor rank. In this way, we detect the first infinite family of Gabidulin codes which are not minimum tensor rank.
- Published
- 2022
24. Rank-Metric Codes, Semifields, and the Average Critical Problem
- Author
-
Gruica, Anina, Ravagnani, Alberto, Sheekey, John, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,Mathematics - Rings and Algebras - Abstract
We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical Problem for combinatorial geometries by Crapo and Rota. Using methods from semifield theory, we derive two lower bounds for the density function of full-rank, square MRD codes. The first bound is sharp when the matrix size is a prime number and the underlying field is sufficiently large, while the second bound applies to the binary field. We then take a new look at the Critical Problem for combinatorial geometries, approaching it from a qualitative, often asymptotic, viewpoint. We illustrate the connection between this very classical problem and that of computing the asymptotic density of MRD codes. Finally, we study the asymptotic density of some special families of codes in the rank metric, including the symmetric, alternating and Hermitian ones. In particular, we show that the optimal codes in these three contexts are sparse.
- Published
- 2022
25. Classifications and constructions of minimum size linear sets
- Author
-
Napolitano, Vito, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,05B25, 51E20, 11P70, 12F99 - Abstract
This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets have been found by Lunardon and the second author (2000) and, more recently, by Jena and Van de Voorde (2021). However, classification results for minimum size linear sets are known only for $k\leq 5$. In this paper we provide classification results for those $L_U$ admitting two points with complementary weights. We construct new examples and also study the related $\mathrm{\Gamma L}(2,q^n)$-equivalence issue. These results solve an open problem posed by Jena and Van de Voorde. The main tool relies on two results by Bachoc, Serra and Z\'emor (2017 and 2018) on the linear analogues of Kneser's and Vosper's theorems. We then conclude the paper pointing out a connection between critical pairs and linear sets, obtaining also some classification results for critical pairs.
- Published
- 2022
26. Two pointsets in $\mathrm{PG}(2,q^n)$ and the associated codes
- Author
-
Napolitano, Vito, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the construction of translation KM-arcs. We point out that their intersections pattern with lines is related to the weight distribution of the considered linear set $L$. We then consider the Hamming metric codes associated with both these constructions, for which we can completely describe their weight distributions. By choosing $L$ to be an $\mathbb{F}_q$-linear set with a short weight distribution, then the associated codes have few weights. We conclude the paper by providing a connection between the $\Gamma\mathrm{L}$-class of $L$ and the number of inequivalent codes we can construct starting from it.
- Published
- 2021
27. Multi-orbit cyclic subspace codes and linear sets
- Author
-
Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
Cyclic subspace codes gained a lot of attention especially because they may be used in random network coding for correction of errors and erasures. Roth, Raviv and Tamo in 2018 established a connection between cyclic subspace codes (with certain parameters) and Sidon spaces. These latter objects were introduced by Bachoc, Serra and Z\'emor in 2017 in relation with the linear analogue of Vosper's Theorem. This connection allowed Roth, Raviv and Tamo to construct large classes of cyclic subspace codes with one or more orbits. In this paper we will investigate cyclic subspace codes associated to a set of Sidon spaces, that is cyclic subspace codes with more than one orbit. Moreover, we will also use the geometry of linear sets to provide some bounds on the parameters of a cyclic subspace code. Conversely, cyclic subspace codes are used to construct families of linear sets which extend a class of linear sets recently introduced by Napolitano, Santonastaso, Polverino and the author. This yields large classes of linear sets with a special pattern of intersection with the hyperplanes, defining rank metric and Hamming metric codes with only three distinct weights., Comment: Title and the organization of the paper have been changed. Accepted for publication for Finite Fields and Their Applications
- Published
- 2021
28. The geometry of one-weight codes in the sum-rank metric
- Author
-
Neri, Alessandro, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics ,11T71, 51E20, 11T06, 94B05 - Abstract
We provide a geometric characterization of $k$-dimensional $\mathbb{F}_{q^m}$-linear sum-rank metric codes as tuples of $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We then use this characterization to study one-weight codes in the sum-rank metric. This leads us to extend the family of linearized Reed-Solomon codes in order to obtain a doubly-extended version of them. We prove that these codes are still maximum sum-rank distance (MSRD) codes and, when $k=2$, they are one-weight, as in the Hamming-metric case. We then focus on constant rank-profile codes in the sum-rank metric, which are a special family of one weight-codes, and derive constraints on their parameters with the aid of an associated Hamming-metric code. Furthermore, we introduce the $n$-simplex codes in the sum-rank metric, which are obtained as the orbit of a Singer subgroup of $\mathrm{GL}(k,q^m)$. They turn out to be constant rank-profile - and hence one-weight - and generalize the simplex codes in both the Hamming and the rank metric. Finally, we focus on $2$-dimensional one-weight codes, deriving constraints on the parameters of those which are also MSRD, and we find a new construction of one-weight MSRD codes when $q=2$.
- Published
- 2021
29. Linear maximum rank distance codes of exceptional type
- Author
-
Bartoli, Daniele, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics - Abstract
Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as defined in 2018 by the first author and Zhou, for which partial classification results are known. In this paper we propose a unified algebraic description of $\mathbb{F}_{q^n}$-linear maximum rank distance codes, introducing the notion of exceptional linear maximum rank distance codes of a given index. Such a connection naturally extends the notion of exceptionality for a scattered polynomial in the rank metric framework and provides a generalization of Moore sets in the monomial MRD context. We move towards the classification of exceptional linear MRD codes, by showing that the ones of index zero are generalized Gabidulin codes and proving that in the positive index case the code contains an exceptional scattered polynomial of the same index.
- Published
- 2021
30. Maximum flag-rank distance codes
- Author
-
Alfarano, Gianira N., Neri, Alessandro, and Zullo, Ferdinando
- Published
- 2024
- Full Text
- View/download PDF
31. Linear sets on the projective line with complementary weights
- Author
-
Napolitano, Vito, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,11T71, 11T06, 94B05 - Abstract
Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two points for which the sum of their weights equals the rank of the linear set. As a special case, we study those linear sets having exactly two points of weight greater than one, by showing new examples and studying their equivalence issue. Also we determine some linearized polynomials defining the linear sets recently introduced by Jena and Van de Voorde (2021).
- Published
- 2021
32. On the infiniteness of a family of APN functions
- Author
-
Bartoli, Daniele, Calderini, Marco, Polverino, Olga, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Mathematics - Algebraic Geometry - Abstract
APN functions play a fundamental role in cryptography against attacks on block ciphers. Several families of quadratic APN functions have been proposed in the recent years, whose construction relies on the existence of specific families of polynomials. A key question connected with such constructions is to determine whether such APN functions exist for infinitely many dimensions or not. In this paper we consider a family of functions recently introduced by Li et al. in 2021 showing that for any dimension $m\geq 3$ there exists an APN function belonging to such a family. Our main result is proved by a combination of different techniques arising from both algebraic varieties over finite fields connected with linearized permutation rational functions and {partial vector space partitions}, together with investigations on the kernels of linearized polynomials.
- Published
- 2021
33. Decoding a class of maximum Hermitian rank metric codes
- Author
-
Kadir, Wrya K., Li, Chunlei, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory - Abstract
Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are both odd., Comment: Accepted for the 6th International Workshop on Boolean Functions and their Applications (BFA) - 6-10 September 2021
- Published
- 2021
34. On interpolation-based decoding of a class of maximum rank distance codes
- Author
-
Kadir, Wrya K., Li, Chunlei, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory - Abstract
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with a linearized polynomial with a given rank and the modified Berlekamp-Massey algorithm in decoding. When the rank of the error vector attains the unique decoding radius, the problem is converted to solving a quadratic polynomial, which ensures that the proposed decoding algorithm has polynomial-time complexity., Comment: Accepted for presentation at 2021 IEEE International Symposium on Information Theory (ISIT)
- Published
- 2021
35. Extending two families of maximum rank distance codes
- Author
-
Neri, Alessandro, Santonastaso, Paolo, and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics ,11T71, 11T06, 94B05 - Abstract
In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are $\mathbb{F}_{q^{2t}}$-linear of dimension $2$ in the space of linearized polynomials over $\mathbb{F}_{q^{2t}}$, where $t$ is any integer greater than $2$, and we prove that they are maximum rank distance codes. For $t\ge 5$, we determine their equivalence classes and these codes turn out to be inequivalent to any other construction known so far, and hence they are really new.
- Published
- 2021
36. On the list decodability of rank-metric codes containing Gabidulin codes
- Author
-
Santonastaso, Paolo and Zullo, Ferdinando
- Subjects
Computer Science - Information Theory ,Mathematics - Combinatorics ,94B35, 94B05 - Abstract
Wachter-Zeh in [42], and later together with Raviv [31], proved that Gabidulin codes cannot be efficiently list decoded for any radius $\tau$, providing that $\tau$ is large enough. Also, they proved that there are infinitely many choices of the parameters for which Gabidulin codes cannot be efficiently list decoded at all. Subsequently, in [41] these results have been extended to the family of generalized Gabidulin codes and to further family of MRD-codes. In this paper, we provide bounds on the list size of rank-metric codes containing generalized Gabidulin codes in order to determine whether or not a polynomial-time list decoding algorithm exists. We detect several families of rank-metric codes containing a generalized Gabidulin code as subcode which cannot be efficiently list decoded for any radius large enough and families of rank-metric codes which cannot be efficiently list decoded. These results suggest that rank-metric codes which are $\mathbb{F}_{q^m}$-linear or that contains a (power of) generalized Gabidulin code cannot be efficiently list decoded for large values of the radius.
- Published
- 2021
37. Investigating the exceptionality of scattered polynomials
- Author
-
Bartoli, Daniele, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Mathematics - Number Theory ,11T06, 51E20, 51E22, 05B25 - Abstract
Scattered polynomials over a finite field $\mathbb{F}_{q^n}$ have been introduced by Sheekey in 2016, and a central open problem regards the classification of those that are exceptional. So far, only two families of exceptional scattered polynomials are known. Very recently, Longobardi and Zanella weakened the property of being scattered by introducing the notion of L-$q^t$-partially scattered and R-$q^t$-partially scattered polynomials, for $t$ a divisor of $n$. Indeed, a polynomial is scattered if and only if it is both L-$q^t$-partially scattered and R-$q^t$-partially scattered. In this paper, by using techniques from algebraic geometry over finite fields and function fields theory, we show that the property which is is the hardest to be preserved is the L-$q^t$-partially scattered one. On the one hand, we are able to extend the classification results of exceptional scattered polynomials to exceptional L-$q^t$-partially scattered polynomials. On the other hand, the R-$q^t$-partially scattered property seems more stable. We present a large family of R-$q^t$-partially scattered polynomials, containing examples of exceptional R-$q^t$-partially scattered polynomials, which turn out to be connected with linear sets of so-called pseudoregulus type. In order to detect new examples of polynomials which are R-$q^t$-partially scattered, we introduce two different notions of equivalence preserving this property and concerning natural actions of the groups ${\rm \Gamma L}(2,q^n)$ and ${\rm \Gamma L}(2n/t,q^t)$. In particular, our family contains many examples of inequivalent polynomials, and geometric arguments are used to determine the equivalence classes under the action of ${\rm \Gamma L}(2n/t,q^t)$.
- Published
- 2021
38. $r$-fat linearized polynomials over finite fields
- Author
-
Bartoli, Daniele, Micheli, Giacomo, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics - Abstract
In this paper we prove that the property of being scattered for a $\mathbb{F}_q$-linearized polynomial of small $q$-degree over a finite field $\mathbb{F}_{q^n}$ is unstable, in the sense that, whenever the corresponding linear set has at least one point of weight larger than one, the polynomial is far from being scattered. To this aim, we define and investigate $r$-fat polynomials, a natural generalization of scattered polynomials. An $r$-fat $\mathbb{F}_q$-linearized polynomial defines a linear set of rank $n$ in the projective line of order $q^n$ with $r$ points of weight larger than one. When $r$ equals $1$, the corresponding linear sets are called clubs, and they are related with a number of remarkable mathematical objects like KM-arcs, group divisible designs and rank metric codes. Using techniques on algebraic curves and global function fields, we obtain numerical bounds for $r$ and the non-existence of exceptional $r$-fat polynomials with $r>0$. In the case $n\leq 4$, we completely determine the spectrum of values of $r$ for which an $r$-fat polynomial exists. In the case $n=5$, we provide a new family of $1$-fat polynomials. Furthermore, we determine the values of $r$ for which the so-called LP-polynomials are $r$-fat.
- Published
- 2020
39. Linearized trinomials with maximum kernel
- Author
-
Santonastaso, Paolo and Zullo, Ferdinando
- Subjects
Mathematics - Number Theory ,Computer Science - Information Theory ,Mathematics - Combinatorics ,11T06, 15A04 - Abstract
Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of $\mathrm{Gal}(\mathbb{F}_{q^n}\colon\mathbb{F}_q)$. In this paper we provide closed formulas for the coefficients of a $\sigma$-trinomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the dimension of the kernel of $f$ equals its $\sigma$-degree, that is linearized polynomials with maximum kernel. As a consequence, we present explicit examples of linearized trinomials with maximum kernel and characterize those having $\sigma$-degree $3$ and $4$. Our techniques rely on the tools developed in [24]. Finally, we apply these results to investigate a class of rank metric codes introduced in [8], to construct quasi-subfield polynomials and cyclic subspace codes, obtaining new explicit constructions to the conjecture posed in [37]., Comment: Accepted for publication in Journal of Pure and Applied Algebra
- Published
- 2020
40. Scattered subspaces and related codes
- Author
-
Zini, Giovanni and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,51E20, 94B27, 15A04 - Abstract
After a seminal paper by Shekeey (2016), a connection between maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(r,q^n)$ and maximum rank distance (MRD) codes has been established in the extremal cases $h=1$ and $h=r-1$. In this paper, we propose a connection for any $h\in\{1,\ldots,r-1\}$, extending and unifying all the previously known ones. As a consequence, we obtain examples of non-square MRD codes which are not equivalent to generalized Gabidulin or twisted Gabidulin codes. Up to equivalence, we classify MRD codes having the same parameters as the ones in our connection. Also, we determine the weight distribution of codes related to the geometric counterpart of maximum $h$-scattered subspaces.
- Published
- 2020
41. On certain linearized polynomials with high degree and kernel of small dimension
- Author
-
Polverino, Olga, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,Mathematics - Number Theory ,11T06, 11G20, 51E20, 51E22 - Abstract
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\'ok 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.
- Published
- 2020
42. On the intersection problem for linear sets in the projective line
- Author
-
Zini, Giovanni and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,51E20, 05B25, 51E22 - Abstract
The aim of this paper is to investigate the intersection problem between two linear sets in the projective line over a finite field. In particular, we analyze the intersection between two clubs with eventually different maximum fields of linearity. Also, we analyze the intersection between the linear set defined by the polynomial $\alpha x^{q^k}+\beta x$ and other linear sets having the same rank; this family contains the linear set of pseudoregulus type defined by $x^q$. The strategy relies on the study of certain algebraic curves whose rational points describe the intersection of the two linear sets. Among other geometric and algebraic tools, function field theory and the Hasse-Weil bound play a crucial role. As an application, we give asymptotic results on semifields of BEL-rank two.
- Published
- 2020
43. Codes with few weights arising from linear sets
- Author
-
Napolitano, Vito and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory - Abstract
In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular, our construction yields also to linear codes with three weights and, in some cases, to almost MDS codes. The interest for these codes relies on their applications to authentication codes and secret schemes, and their connections with further objects such as association schemes and graphs.
- Published
- 2020
44. Connections between scattered linear sets and MRD-codes
- Author
-
Polverino, Olga and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,51E20, 05B25, 51E22 - Abstract
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)., Comment: Accepted for publication in Bulletin of the Institute of Combinatorics and its Applications
- Published
- 2020
45. Linear sets from projection of Desarguesian spreads
- Author
-
Napolitano, Vito, Polverino, Olga, Zini, Giovanni, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,05B25, 51E20, 51E22 - Abstract
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.
- Published
- 2020
46. On maximum additive Hermitian rank-metric codes
- Author
-
Trombetti, Rocco and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,05E15, 05E30, 51E22 - Abstract
Inspired by the work of Zhou "On equivalence of maximum additive symmetric rank-distance codes" (2020) based on the paper of Schmidt "Symmetric bilinear forms over finite fields with applications to coding theory" (2015), we investigate the equivalence issue of maximum $d$-codes of Hermitian matrices. More precisely, in the space $\mathrm{H}_n(q^2)$ of Hermitian matrices over $\mathbb{F}_{q^2}$ we have two possible equivalence: the classical one coming from the maps that preserve the rank in $\mathbb{F}_{q^2}^{n\times n}$, and the one that comes from restricting to those maps preserving both the rank and the space $\mathrm{H}_n(q^2)$. We prove that when $d
- Published
- 2020
47. A new family of maximum scattered linear sets in $\mathrm{PG}(1,q^6)$
- Author
-
Bartoli, Daniele, Zanella, Corrado, and Zullo, Ferdinando
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,51E20, 05B25, 51E22 - Abstract
We generalize the example of linear set presented by the last two authors in "Vertex properties of maximum scattered linear sets of $\mathrm{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 $\mathrm{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)$.
- Published
- 2019
48. Classifications and constructions of minimum size linear sets on the projective line
- Author
-
Napolitano, Vito, Polverino, Olga, Santonastaso, Paolo, and Zullo, Ferdinando
- Published
- 2023
- Full Text
- View/download PDF
49. Cones from maximum h-scattered linear sets and a stability result for cylinders from hyperovals
- Author
-
Adriaensen, Sam, Mannaert, Jonathan, Santonastaso, Paolo, and Zullo, Ferdinando
- Published
- 2023
- Full Text
- View/download PDF
50. Saturating linear sets in PG(2,q4)
- Author
-
Zullo, Ferdinando, primary
- Published
- 2024
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.