Martino Borello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Martino Borello has a total of 39 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
5 shared publications - Giuseppe Marino
Dipartimento di Matematica e Applicazioni “Renato Caccioppoli”, Università degli Studi di Napoli Federico II, Napoli, Italy
4 shared publications - Eimear Byrne
University College Dublin
3 shared publications - Gianira N. Alfarano
University College Dublin, Belfield, Dublin 4, Ireland
3 shared publications - Matteo Bonini
Department of Mathematical Sciences, Aalborg University, Aalborg, Denmark
3 shared publications Wolfgang Willems
Otto-von-Guericke Universität, Magdeburg, Germany and Universidad del Norte, Barranquilla, Colombia
3 shared publications
Latest Publications
- 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
Delsarte duality on subspaces and applications to rank-metric codes and q-matroids
We study the interplay between the lattice of F_{q^m}-subspaces and the lattice of F_{q^m}-subspaces of an F_{q^m}-vector space. Introducing notions of weight and defect relative to an F_q-subspace, we analyze the sequence of maximum non-zero defects. We establish a correspondence between subspaces of positive defect and their Delsarte duals, enabling explicit characterizations of the associated sequences of maximum non-zero defects. Our framework unifies several classes of subspaces studied in finite geometry and connects them to linear rank-metric codes by providing a new geometric interpretation of code duality. Building on these results, we characterize classes of rank-metric codes closed under duality, including MRD, near MRD, quasi-MRD, and a new family of (n, k)-MRD codes. Finally, we explore applications to q-matroids, by studying the problem of F_{q^m}-representability for direct sums of uniform q-matroids and describing their rank generating functions.
Open AccessDelsarte duality on subspaces and applications to rank-metric codes and q-matroids
We study the interplay between the lattice of F_{q^m}-subspaces and the lattice of F_{q^m}-subspaces of an F_{q^m}-vector space. Introducing notions of weight and defect relative to an F_q-subspace, we analyze the sequence of maximum non-zero defects. We establish a correspondence between subspaces of positive defect and their Delsarte duals, enabling explicit characterizations of the associated sequences of maximum non-zero defects. Our framework unifies several classes of subspaces studied in finite geometry and connects them to linear rank-metric codes by providing a new geometric interpretation of code duality. Building on these results, we characterize classes of rank-metric codes closed under duality, including MRD, near MRD, quasi-MRD, and a new family of (n, k)-MRD codes. Finally, we explore applications to q-matroids, by studying the problem of F_{q^m}-representability for direct sums of uniform q-matroids and describing their rank generating functions.
- 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.
- 24 May 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
Dihedral quantum codes
We establish dihedral quantum codes of short block length, a class of Calderbank–Shor–Steane (CSS) codes obtained by the lifted product construction. We present the code construction and give a formula for the code dimension, depending on the two classical codes that the CSS code is based on. We also give a lower bound on the code distance and construct an example of short dihedral quantum codes.
- 24 May 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 24 (13n14)
Dihedral quantum codes
We establish dihedral quantum codes of short block length, a class of Calderbank–Shor–Steane (CSS) codes obtained by the lifted product construction. We present the code construction and give a formula for the code dimension, depending on the two classical codes that the CSS code is based on. We also give a lower bound on the code distance and construct an example of short dihedral quantum codes.
- Open Access
- 9 April 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2993-3009
The geometry of covering codes in the sum–rank metric
We introduce the concept of a sum–rank saturating system and outline its correspondence to covering properties of a sum–rank metric code. We consider the problem of determining the shortest length of a sum–rank- $$\rho $$ -saturating system of a fixed dimension, which is equivalent to the covering problem in the sum–rank metric. We obtain upper and lower bounds on this quantity. We also give constructions of saturating systems arising from geometrical structures.- 9 April 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 2993-3009
Open AccessThe geometry of covering codes in the sum–rank metric
We introduce the concept of a sum–rank saturating system and outline its correspondence to covering properties of a sum–rank metric code. We consider the problem of determining the shortest length of a sum–rank- $$\rho $$ -saturating system of a fixed dimension, which is equivalent to the covering problem in the sum–rank metric. We obtain upper and lower bounds on this quantity. We also give constructions of saturating systems arising from geometrical structures. - 27 February 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 214
The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- 27 February 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 214
The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- Open Access
A geometric invariant of linear rank-metric codes
Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent research has focused on constructing new families of rank-metric codes with distinct algebraic structures, emphasizing the importance of invariants for distinguishing these codes from known families and from random ones. In this paper, we introduce a novel geometric invariant for linear rank-metric codes, inspired by the Schur product used in the Hamming metric. By examining the sequence of dimensions of Schur powers of the extended Hamming code associated with a linear code, we demonstrate its ability to differentiate Gabidulin codes from random ones. From a geometric perspective, this approach investigates the vanishing ideal of the linear set corresponding to the rank-metric code.
Open AccessA geometric invariant of linear rank-metric codes
Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent research has focused on constructing new families of rank-metric codes with distinct algebraic structures, emphasizing the importance of invariants for distinguishing these codes from known families and from random ones. In this paper, we introduce a novel geometric invariant for linear rank-metric codes, inspired by the Schur product used in the Hamming metric. By examining the sequence of dimensions of Schur powers of the extended Hamming code associated with a linear code, we demonstrate its ability to differentiate Gabidulin codes from random ones. From a geometric perspective, this approach investigates the vanishing ideal of the linear set corresponding to the rank-metric code.
- Open Access
- 5 April 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (2) , P2.18
Outer Strong Blocking Sets
Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method, introducing the concept of outer strong blocking sets and their coding theoretical counterpart. We investigate their structure and provide bounds on their size. As a byproduct, we improve the best-known upper bound on the minimum size of a strong blocking set. Finally, we present a geometric construction of small strong blocking sets, whose computational cost is significantly smaller than the previously known ones.
- 5 April 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (2) , P2.18
Open AccessOuter Strong Blocking Sets
Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method, introducing the concept of outer strong blocking sets and their coding theoretical counterpart. We investigate their structure and provide bounds on their size. As a byproduct, we improve the best-known upper bound on the minimum size of a strong blocking set. Finally, we present a geometric construction of small strong blocking sets, whose computational cost is significantly smaller than the previously known ones.
- Open Access
Outer Strong Blocking Sets
Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method, introducing the concept of outer strong blocking sets and their coding theoretical counterpart. We investigate their structure and provide bounds on their size. As a byproduct, we improve the best-known upper bound on the minimum size of a strong blocking set. Finally, we present a geometric construction of small strong blocking sets, whose computational cost is significantly smaller than the previously known ones.
Open AccessOuter Strong Blocking Sets
Strong blocking sets, introduced first in 2011 in connection with saturating sets, have recently gained a lot of attention due to their correspondence with minimal codes. In this paper, we dig into the geometry of the concatenation method, introducing the concept of outer strong blocking sets and their coding theoretical counterpart. We investigate their structure and provide bounds on their size. As a byproduct, we improve the best-known upper bound on the minimum size of a strong blocking set. Finally, we present a geometric construction of small strong blocking sets, whose computational cost is significantly smaller than the previously known ones.
- 21 February 2024
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 95
Saturating linear sets of minimal rank
- 21 February 2024
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 95
Saturating linear sets of minimal rank