12 citations · 12 across the 10 of their papers we have counts for
12 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…
The Coverage Depth Problem in DNA Storage Over Small Alphabets
Matteo Bertuzzo, Alberto Ravagnani, Eitan Yaakobi
The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance i…
Equivalence of Serial and Parallel A-Posteriori Probabilities in the Decoding of DAB Systems
Andrea Di Giusto, Wim van Houtum, Alberto Ravagnani +1
Motivated by applications to digital audio broadcasting (DAB) systems, we study the a-posteriori probabilities (APPs) of the coded and information bits of the serial concatenation…
Bounds and Codes for General Phased Burst Errors
Sebastian Bitzer, Andrea Di Giusto, Alberto Ravagnani +1
Phased burst errors (PBEs) are bursts of errors occurring at one or more known locations. The correction of PBEs is a classical topic in coding theory, with prominent applications…
Weighted-Hamming Metric for Parallel Channels
Sebastian Bitzer, Alberto Ravagnani, Violetta Weger
Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enabl…
Structure of CSS and CSS-T Quantum Codes
Elena Berardini, Alessio Caminata, Alberto Ravagnani
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of line…
External Codes for Multiple Unicast Networks via Interference Alignment
F. R. Kschischang, F. Manganiello, A. Ravagnani +1
We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the proble…