The Coverage Depth Problem in DNA Storage Over Small Alphabets
By: Matteo Bertuzzo, Alberto Ravagnani, Eitan Yaakobi
Potential Business Impact:
Stores more computer data in tiny DNA.
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 in this context. This paper focuses on the scenario where the base field is not large enough to allow the existence of MDS codes. We investigate the performance for the coverage depth problem of codes defined over a small finite field, providing closed formulas for the expected number of reads for various code families. We also compare the results with the theoretical bounds in asymptotic regimes. The techniques we apply range from probability, to duality theory and combinatorics.
Similar Papers
The Random Variables of the DNA Coverage Depth Problem
Information Theory
Stores more computer information in tiny DNA.
Optimizing Sequencing Coverage Depth in DNA Storage: Insights From DNA Storage Data
Information Theory
Stores more computer data in tiny DNA.
On the Reliability of Information Retrieval From MDS Coded Data in DNA Storage
Information Theory
Stores more information safely in DNA.