Family of Constrained Codes for Archival DNA Data Storage

Family of Constrained Codes for Archival DNA Data Storage

DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2018-10, Vol.22 (10), p.1972-1975
Hauptverfasser: Limbachiya, Dixita, Gupta, Manish K., Aggarwal, Vaneet
Format: Artikel
Sprache:eng
Schlagworte:
3G mobile communication
Biological evolution
Codes
constrained codes
Data storage
Deoxyribonucleic acid
DNA
DNA codes
DNA storage
Electronic mail
Encoding
Memory
Nucleotides
Sequential analysis
Storage systems
Weight
Writing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:DNA-based data storage systems have evolved as a solution to accommodate data explosion. In this letter, some properties of DNA codewords that are essential for an archival DNA storage are considered for the design of codes. Constraint-based DNA codes, which avoid runs of nucleotides, have fixed GC-weight, and a specific minimum distance is presented. An altruistic algorithm that enumerates DNA codewords with the above constraints is provided. A theoretical bound on such DNA codewords is obtained. This bound is tight when there is no minimum distance constraint.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2018.2861867