On Single-Error-Detecting Codes for DNA-Based Data Storage

Journal Article (2021)
Author(s)

J.H. Weber (TU Delft - Discrete Mathematics and Optimization)

JAM de Groot (TU Delft - Mathematical Physics)

Charlot J. Van Leeuwen (Student TU Delft)

Research Group
Discrete Mathematics and Optimization
Copyright
© 2021 J.H. Weber, J.A.M. de Groot, Charlot J. Van Leeuwen
DOI related publication
https://doi.org/10.1109/LCOMM.2020.3023826
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 J.H. Weber, J.A.M. de Groot, Charlot J. Van Leeuwen
Research Group
Discrete Mathematics and Optimization
Issue number
1
Volume number
25
Pages (from-to)
41-44
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

DNA-based storage is considered to be a promising option to accommodate huge amounts of data. The strings of nucleotides are prone to errors though. To reduce the error probability, these strings should satisfy constraints on the ratio of A's and T's versus the number of G's and C's, and on the maximum number of repeated identical nucleotides. To deal with errors when they occur after all, it is also desirable that the set of DNA-strings possesses certain error correction or detection capabilities. This is established by designing quaternary constrained codes with a specified minimum distance. Here, maximum-sized block codes with a fixed number of G/C symbols, no symbol repetition, and a minimum Hamming distance of two are presented.

Files

License info not available