pith. sign in

arxiv: 1207.3385 · v1 · pith:XZWM57Q3new · submitted 2012-07-14 · 💻 cs.IT · math.IT

Construction of Cyclic Codes over mathbb{F}₂+umathbb{F}₂ for DNA Computing

classification 💻 cs.IT math.IT
keywords mathbbcodescomplementcomputingconstraintconstructcyclicring
0
0 comments X
read the original abstract

We construct codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ with $u^2=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 $\mathbb{F}_2+u\mathbb{F}_2$. We also construct an infinite family of BCH DNA codes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.