2000 character limit reached
Construction of Cyclic Codes over $\mathbb{F}_2+u\mathbb{F}_2$ for DNA Computing
Published 14 Jul 2012 in cs.IT and math.IT | (1207.3385v1)
Abstract: We construct codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ with $u2=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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.