9 papers
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…
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…
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,…
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…
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…