2 papers
cs.IT2026
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…
cs.IT2025
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…