High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes
<|reference_start|>High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes: DNA-based data storage has been attracting significant attention due to its extremely high density, low power consumption, and long duration compared to traditional data storage mediums. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carry out large scale experiments to validate our proposed DNA data storage architecture. Specifically, 1.61 and 1.69 MB data are encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages 4.5 and 6.0, respectively. Compared to previous experimental studies, our architecture achieves higher information density and lower coverage, demonstrating the efficiency of the proposed channel coding schemes.<|reference_end|>
@article{ding2024high,
    title={High Information Density and Low Coverage Data Storage in DNA with
  Efficient Channel Coding Schemes},
    author={Yi Ding, Xuan He, Tuan Thanh Nguyen, Wentu Song, Zohar Yakhini, Eitan
  Yaakobi, Linqiang Pan, Xiaohu Tang, Kui Cai},
    journal={arXiv preprint arXiv:2410.04886},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04886},
    primaryClass={cs.IT math.IT}
}