7 papers
Linear Code Conversion in the Merge Regime: General Bounds and Reed-Muller Constructions
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Erasure codes are a core component of most existing large-scale distributed storage systems, ensuring reliability against node failures. Recent work has shown that adapting code pa…
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…
Counting q-Matroids
Benjamin Jany, Relinde Jurrius, Rudi Pendavingh
-Matroids, a -analogue of classical matroids have attracted a lot of attention over the last decade, yet their enumeration remains largely unexplored. In this paper, we study…
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…
Convertible Codes for Data and Device Heterogeneity
Anina Gruica, Benjamin Jany, Stanislav Kruglik
Distributed storage systems must handle both data heterogeneity, arising from non-uniform access demands, and device heterogeneity, caused by time-varying node reliability. In this…
Polynomial Invariants of q-Matroids and Rank-Metric Codes
Heide Gluesing-Luerssen, Benjamin Jany
It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via…