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

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 8; pp. 49523 - 49531
Main Authors: Immink, Kees A. Schouhamer, Cai, Kui
Format: Journal Article
Language:English
Published: Piscataway IEEE 2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
balanced words
Constrained coding
Constraints
Data storage
Deoxyribonucleic acid
DNA
DNA-based storage
Encoding
maximum runlength
Memory
Redundancy
Repetition
Routines
Sequences
Sequential analysis
storage systems
Table lookup
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2980036