Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Mo-AM-1-1
Session:
Number:Mo-AM-1-1.5
On Constant GC-content Cyclic DNA Codes With Long Codewords
Ramy Taki ElDin, Hajime Matsui,
pp.21-25
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Mo-AM-1-1.5
PDF download
Summary:
In this study, we construct a cyclic DNA code that satisfies the Watson-Crick model, i.e., the reverse and the complement of any codeword are codewords. Similar to irreducible cyclic codes, we use the trace function over a finite field extension to generate our DNA code. MacWilliams?Seery algorithm to evaluate the weight distribution of binary irreducible cyclic codes is used to observe the GC-content distribution of our code. Then, a simple algorithm is proposed to select a subcode with constant GC-content. Therefore, this sub-code would be a cyclic, reverse-complement, and constant GC-content DNA code. A few illustrative examples show the appropriateness of our algorithm for generating over 100000 DNA strands of length n > 1000 and a predefined constant GC-content.