44 citations · 100 across the 48 of their papers we have counts for
66 papers
Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes
Roee Gross, Yitzchak Grunbaum, Matteo Bertuzzo +2
DNA storage systems retrieve information by randomly sampling synthesized DNA strands, making the number of reads required for successful recovery a fundamental performance measure…
A New Invariant for Prime Alternating Knots From Error-Correcting Codes
Altan B. Kilic, Ruud Pellikaan, Alberto Ravagnan
This paper shows that the Alexander-Briggs code of a knot gives rise to a new invariant that distinguishes prime alternating knots. The restriction to prime alternating knots preci…
Capacity of Non-Separable Networks with Restricted Adversaries
Christopher Hojny, Altan B. Kılıç, Sascha Kurz +1
This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to opera…
Intersecting Codes and the Connectivity of -Matroids
Fabrizio Conca, Benjamin Jany, Alberto Ravagnani
We investigate the structure of intersecting error-correcting codes, with a particular focus on their connection to matroid theory. We establish properties and bounds for intersect…
The Star Product of Uniformly Random Codes
Johan Vester Dinesen, Ragnar Freij-Hollanti, Camilla Hollanti +2
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We use a corr…
The Eigenvalue Method in Coding Theory
Aida Abiad, Loes Peters, Alberto Ravagnani
We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes fo…
The Length of Functional Batch and PIR Codes
Altan B. Kilic, Alberto Ravagnani, Flavio Salizzoni
We consider the problem of computing the minimum length of functional batch and PIR codes of fixed dimension and for a fixed list size, over an arbitrary finite field. We recover,…
Multishot Capacity of Networks with Restricted Adversaries
Giuseppe Cotardo, Gretchen L. Matthews, Alberto Ravagnani +1
We investigate adversarial network coding and decoding, focusing on the multishot regime and when the adversary is restricted to operate on a vulnerable region of the network. Erro…
Whitney Numbers of Rank-Metric Lattices and Code Enumeration
Giuseppe Cotardo, Alberto Ravagnani, Ferdinando Zullo
We investigate the Whitney numbers of the first kind of rank-metric lattices, which are closely linked to the open problem of enumerating rank-metric codes having prescribed parame…
On the Parameters of Codes for Data Access
Altan B. Kilic, Alberto Ravagnani, Emina Soljanin
This paper studies two crucial problems in the context of coded distributed storage systems directly related to their performance: 1) for a fixed alphabet size, determine the minim…
-Balanced Codes with the Kendall- Metric
Benjamin Jany, Alberto Ravagnani
We investigate the maximum cardinality and the mathematical structure of error-correcting codes endowed with the Kendall- metric. We establish an averaging bound for the cardina…
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…
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani +1
We investigate the fundamental limits of the recently proposed random access coverage depth problem for DNA data storage. Under this paradigm, it is assumed that the user informati…
Rank-Metric Codes and Their Parameters
Anina Gruica, Altan B. Kilic, Alberto Ravagnani
We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum r…
The Diagonals of a Ferrers Diagram
Giuseppe Cotardo, Anina Gruica, Alberto Ravagnani
We propose and develop a theory of Ferrers diagrams and their -rook polynomials solely based on their diagonals. We show that the cardinalities of the diagonals of a Ferrers dia…
LRCs: Duality, LP Bounds, and Field Size
Anina Gruica, Benjamin Jany, Alberto Ravagnani
We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of wei…
Multishot Adversarial Network Decoding
Giuseppe Cotardo, Gretchen L. Matthews, Alberto Ravagnani +1
We investigate adversarial network coding and decoding focusing on the multishot regime. Errors can occur on a proper subset of the network edges and are modeled via an adversarial…
Knot Theory and Error-Correcting Codes
Altan B. Kilic, Anne Nijsten, Ruud Pellikaan +1
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting c…
Eigenvalue Bounds for Sum-Rank-Metric Codes
Aida Abiad, Antonina P. Khramova, Alberto Ravagnani
We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of…
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…
Duality and LP Bounds for Codes with Locality
Anina Gruica, Benjamin Jany, Alberto Ravagnani
We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and in…
-Complementary Subspaces and Codes in Finite Bilinear Spaces
Heide Gluesing-Luerssen, Alberto Ravagnani
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their -complementary subspaces, i.e., the subspaces that interse…
Network Coding: An Optimization Approach
Christopher Hojny, Altan B. Kilic, Alberto Ravagnani
We consider the problem of computing the capacity of a coded, multicast network over a small alphabet. We introduce a novel approach to this problem based on mixed integer programm…
Rook Theory of the Etzion-Silberstein Conjecture
Anina Gruica, Alberto Ravagnani
In 2009, Etzion and Siberstein proposed a conjecture on the largest dimension of a linear space of matrices over a finite field in which all nonzero matrices are supported on a Fer…