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

Journal article (2021)

Authors

J.H. Weber Discrete Mathematics and Optimization - EEMCS
J.A.M. de Groot Mathematical Physics - EEMCS
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2021 J.H. Weber, J.A.M. de Groot, Charlot J. Van Leeuwen
DOI: https://doi.org/10.1109/LCOMM.2020.3023826
More Info
expand_more

Published Date

2021

Language

English

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

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

FINAL_VERSION.PDF
09195449.pdf
(pdf | 0.392 Mb)

Download not available