Construction of Cyclic Codes over \mathbbF₂+u\mathbbF₂ for DNA Computing

2012/07/13 by Kenza Guenda, Guenda, Kenza, T. Aaron Gulliver +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Advanced biosensing and bioanalysis techniques #Coding theory and cryptography #DNA and Biological Computing #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1207.3385

arxiv created 2012/07/14 · arxiv updated 2012/07/17

Abstract

We construct codes over the ring \mathbbF₂+u\mathbbF₂ with u²=0. These code are designed for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the GC content constraint and avoid the secondary structure. they are derived from the cyclic complement reversible codes over the ring \mathbbF₂+u\mathbbF₂. We also construct an infinite family of BCH DNA codes.

Related

• On cyclic DNA codes over \mathbbF₂+u\mathbbF₂+u²\mathbbF₂
• Cyclic DNA codes over F2+uF2+vF2+uvF2
• DNA Cyclic Codes Over The Ring \F₂[u,v]/⟨ u²-1,v³-v,uv-vu ⟩
• On cyclic DNA codes over the Ring \Z₄ + u \Z₄
• Construction of cyclic DNA codes over the Ring \Z₄[u]/⟨ u²-1 ⟩ Based on the deletion distance