The Coverage Depth Problem in DNA Storage Over Small Alphabets
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Efficient DNA-based data storage using shortmer combinatorial encodingScientific Reports, 2024
- Data storage in DNA with fewer synthesis cycles using composite DNA lettersNature Biotechnology, 2019
- A Characterization of the DNA Data Storage ChannelScientific Reports, 2019
- Random access in large-scale DNA data storageNature Biotechnology, 2018
- Duality of codes supported on regular lattices, with an application to enumerative combinatoricsDesigns, Codes and Cryptography, 2017
- Portable and Error-Free DNA-Based Data StorageScientific Reports, 2017
- Forward Error Correction for DNA Data StorageProcedia Computer Science, 2016
- A Rewritable, Random-Access DNA-Based Storage SystemScientific Reports, 2015
- On sets of vectors of a finite vector space in which every subset of basis size is a basis IIDesigns, Codes and Cryptography, 2012
- Birthday paradox, coupon collectors, caching algorithms and self-organizing searchDiscrete Applied Mathematics, 1992