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

Jos H. Weber, Joost A.M. De Groot, Charlot J. Van Leeuwen

Research output: Contribution to journalArticleScientificpeer-review

2 Downloads (Pure)

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.

Original languageEnglish
Article number9195449
Pages (from-to)41-44
Number of pages4
JournalIEEE Communications Letters
Volume25
Issue number1
DOIs
Publication statusPublished - 2021

Keywords

  • Constant-weight codes
  • DNA-based data storage
  • error-detecting codes
  • runlength-limited sequences

Fingerprint Dive into the research topics of 'On Single-Error-Detecting Codes for DNA-Based Data Storage'. Together they form a unique fingerprint.

Cite this