9 papers
The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
Matteo Bertuzzo, Alberto Ravagnani, Eitan Yaakobi
The coverage depth problem in DNA data storage is about computing the expected number of reads needed to recover all encoded strands. Given a generator matrix of a linear code, thi…
The Oval Strikes Back
Andrea Di Giusto, Alberto Ravagnani, Emina Soljanin
We investigate the applications of ovals in projective planes to distributed storage, with a focus on the Service Rate Region problem. Leveraging the incidence relations between li…
Weighted-Hamming Metric: Bounds and Codes
Sebastian Bitzer, Alberto Ravagnani, Violetta Weger
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independe…
A distance-free approach to generalized weights
Andrea Di Giusto, Elisa Gorla, Alberto Ravagnani
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defin…
The asymptotic number of equivalence classes of linear codes with given dimension
Andrea Di Giusto, Alberto Ravagnani
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has…
The Random Variables of the DNA Coverage Depth Problem
Åeyma Bodur, Stefano Lia, Hiram H. López +3
DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We…