Construction of Cyclic Codes over $\mathbb{F}_2+u\mathbb{F}_2$ for DNA Computing
Information Theory
2012-07-17 v1 math.IT
Abstract
We construct codes over the ring with . These code are designed for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the content constraint and avoid the secondary structure. they are derived from the cyclic complement reversible codes over the ring . We also construct an infinite family of BCH DNA codes.
Keywords
Cite
@article{arxiv.1207.3385,
title = {Construction of Cyclic Codes over $\mathbb{F}_2+u\mathbb{F}_2$ for DNA Computing},
author = {Kenza Guenda and T. Aaron Gulliver},
journal= {arXiv preprint arXiv:1207.3385},
year = {2012}
}