Paper Info
Title
Run-Length Constraint Of Cyclic Reverse-Complement And Constant Gc-Content Dna Codes
Abstract
In DNA data storage and computation, DNA strands are required to meet certain combinatorial constraints. This paper shows how some of these constraints can be achieved simultaneously. First, we use the algebraic structure of irreducible cyclic codes over finite fields to generate cyclic DNA codes that satisfy reverse and complement properties. We show how such DNA codes can meet constant guanine-cytosine content constraint by MacWilliams-Seery algorithm. Second, we consider fulfilling the run-length constraint in parallel with the above constraints, which allows a maximum predetermined number of consecutive duplicates of the same symbol in each DNA strand. Since irreducible cyclic codes can be represented in terms of the trace function over finite field extensions, the linearity of the trace function is used to fulfill a predefined run-length constraint. Thus, we provide an algorithm for constructing cyclic DNA codes with the above properties including run-length constraint. We show numerical examples to demonstrate our algorithms generating such a set of DNA strands with all the prescribed constraints.
Year
DOI
Venue
2020
10.1587/transfun.2019EAP1053
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
Finite fields, irreducible cyclic codes, weight distribution, trace function, rank-nullity theorem
Complementarity (molecular biology),Discrete mathematics,DNA,GC-content,Mathematics
Journal
Volume
Issue
ISSN
E103A
1
0916-8508
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Ramy Taki ElDin100.34
Hajime Matsui2188.14