Properties and Constructions of Constrained Codes for DNA-Based Data Storage

We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balanc...

Full description

Bibliographic Details
Main Authors: Kees A. Schouhamer Immink, Kui Cai
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9032172/
id doaj-986f2cabb18e4ff2860a44a03a1a4a9e
record_format Article
spelling doaj-986f2cabb18e4ff2860a44a03a1a4a9e2021-03-30T01:25:03ZengIEEEIEEE Access2169-35362020-01-018495234953110.1109/ACCESS.2020.29800369032172Properties and Constructions of Constrained Codes for DNA-Based Data StorageKees A. Schouhamer Immink0https://orcid.org/0000-0001-6747-9261Kui Cai1https://orcid.org/0000-0003-2059-0071Turing Machines Inc., Rotterdam, DK, The NetherlandsSingapore University of Technology and Design (SUTD), SingaporeWe describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.https://ieeexplore.ieee.org/document/9032172/Constrained codingmaximum runlengthbalanced wordsstorage systemsDNA-based storage
collection DOAJ
language English
format Article
sources DOAJ
author Kees A. Schouhamer Immink
Kui Cai
spellingShingle Kees A. Schouhamer Immink
Kui Cai
Properties and Constructions of Constrained Codes for DNA-Based Data Storage
IEEE Access
Constrained coding
maximum runlength
balanced words
storage systems
DNA-based storage
author_facet Kees A. Schouhamer Immink
Kui Cai
author_sort Kees A. Schouhamer Immink
title Properties and Constructions of Constrained Codes for DNA-Based Data Storage
title_short Properties and Constructions of Constrained Codes for DNA-Based Data Storage
title_full Properties and Constructions of Constrained Codes for DNA-Based Data Storage
title_fullStr Properties and Constructions of Constrained Codes for DNA-Based Data Storage
title_full_unstemmed Properties and Constructions of Constrained Codes for DNA-Based Data Storage
title_sort properties and constructions of constrained codes for dna-based data storage
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. Generating functions and approximations are presented for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. Expressions for the redundancy of codes that account for both the maximum repetition length and AT/GC balance are derived.
topic Constrained coding
maximum runlength
balanced words
storage systems
DNA-based storage
url https://ieeexplore.ieee.org/document/9032172/
work_keys_str_mv AT keesaschouhamerimmink propertiesandconstructionsofconstrainedcodesfordnabaseddatastorage
AT kuicai propertiesandconstructionsofconstrainedcodesfordnabaseddatastorage
_version_ 1724187162767785984