activity
20192026
most citedA geometric characterization of minimal codes and their asymptotic performance

44 citations · 63 across the 24 of their papers we have counts for

collaborators

32 papers

cs.IT2026

Code distances of matrix rank-metric codes under Add-and-Remove transformations

Gianira N. Alfarano, Rakhi Pratihar, Adrien Vinçotte

For a matrix rank-metric code and an integer , the -th subcode distance of is the largest minimum rank distance of an -dimensional subcode of $…

math.CO2026

Additive codes arising from hypergraphs

Gianira N. Alfarano

We study the critical exponent of additive codes through an integer polymatroid associated with the code. We give a coding-theoretic proof of Whittle's Critical Theorem in this set…

cs.IT2026

A proof of the generalized packing-covering conjecture

Gianira N. Alfarano, Giuseppe Marino, Alessandro Neri +1

The generalized packing--covering conjecture of Elimelech, Firer and Schwartz asserts that, for every linear code and every admissible order , the -th generaliz…

math.CO2026

Combinatorial constructions of Schubert subspace codes

Gianira N. Alfarano, Alessandro Neri, Beatrice Toesca

We study Schubert subspace codes, which are constant-dimension subspace codes with prescribed intersection conditions with a fixed subspace. Our goal is to construct codes of maxim…

cs.IT2026

Minimal additive codes and additive strong blocking sets

Gianira N. Alfarano, Marine Le Meur

Additive codes over generalize linear codes by relaxing linearity over the alphabet while retaining linearity over the subfield . In this paper, we…

math.CO2026

A geometric approach to generalized covering radii of linear codes

Gianira N. Alfarano, Giuseppe Marino, Alessandro Neri +1

Covering problems in coding theory are closely related to finite geometry through the interpretation of the columns of parity-check matrices as point sets in finite vector spaces.…

math.CO2026

On perfect flag-rank metric codes

Gianira N. Alfarano, Usman Mushrraf, Ferdinando Zullo

Flag-rank-metric codes arise as a natural generalization of rank-metric codes in the context of network communication. While recent research has mainly focused on algebraic and str…

math.CO2026

The geometry of rank-metric codes

Gianira N. Alfarano, Martino Borello, Alessandro Neri

In this paper, we develop a geometric framework for matrix rank-metric codes based on generator tensors and their slice spaces. To every nondegenerate matrix rank-metric code, we a…

math.CO2026

Representability of -matroids via rank-metric codes

Gianira N. Alfarano, Sebastian Degen

Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related t…

math.CO2025

The polytope of all -rank functions

Gianira N. Alfarano, Sebastian Degen

A -rank function is a real-valued function defined on the subspace lattice that is non-negative, upper bounded by the dimension function, non-decreasing, and satisfies the submo…

math.CO2024

The free product of -matroids

Gianira N. Alfarano, Eimear Byrne, Andrew Fulcher

We introduce the notion of the free product of -matroids, which is the -analogue of the free product of matroids. We study the properties of this noncommutative binary operat…

math.CO2024

Representability of the direct sum of uniform q-matroids

Gianira N. Alfarano, Relinde Jurrius, Alessandro Neri +1

There are many similarities between the theories of matroids and -matroids. However, when dealing with the direct sum of -matroids many differences arise. Most notably, it ha…

cs.IT2024

Schubert Subspace Codes

Gianira N. Alfarano, Joachim Rosenthal, Beatrice Toesca

In this paper, we initiate the study of constant dimension subspace codes restricted to Schubert varieties, which we call Schubert subspace codes. These codes have a very natural g…

math.CO2024

Eigenvalue bounds and alternating rank-metric codes

Aida Abiad, Gianira N. Alfarano, Alberto Ravagnani

In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given val…

math.CO2023★ 1 cited

Recursive properties of the characteristic polynomial of weighted lattices

Gianira N. Alfarano, Eimear Byrne

In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the cri…

math.CO2023

Maximum Flag-Rank Distance Codes

Gianira N. Alfarano, Alessandro Neri, Ferdinando Zullo

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…

math.OC2023

The Service Rate Region Polytope

Gianira N. Alfarano, Altan B. Kilic, Alberto Ravagnani +1

We investigate the properties of a family of polytopes that naturally arise in connection with a problem in distributed data storage, namely service rate region polytopes. The serv…

math.CO2023

Outer Strong Blocking Sets

Gianira N. Alfarano, Martino Borello, Alessandro Neri

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 p…

math.CO2022

The Cyclic Flats of a -Matroid

Gianira N. Alfarano, Eimear Byrne

In this paper we develop the theory of cyclic flats of -matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a -matroid and henc…

cs.IT2022

Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery

Gianira N. Alfarano, Alberto Ravagnani, Emina Soljanin

We are concerned with linear redundancy storage schemes regarding their ability to provide concurrent (local) recovery of multiple data objects. This paper initiates a study of suc…

math.CO2021

On Cyclic Matroids and their Applications

Gianira N. Alfarano, Karan Khathuria, Simran Tinani

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely…

math.CO2021

Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric

Gianira N. Alfarano, Martino Borello, Alessandro Neri +1

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the -analogues of projective systems and blocking sets.…

cs.IT2021

Sum-rank product codes and bounds on the minimum distance

Gianira N. Alfarano, F. J. Lobillo, Alessandro Neri +1

The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Spe…

cs.IT2021

Convolutional codes over finite chain rings, MDP codes and their characterization

Gianira N. Alfarano, Anina Gruica, Julia Lieb +1

In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and w…