Construction of cyclic codes over GF (4) for DNA computing

Taher Abualrub, Ali Ghrayeb, Xiang Nian Zeng

Research output: Contribution to journalArticle

33 Citations (Scopus)


In this paper, we develop the theory for constructing linear and additive cyclic codes of odd length over GF (4) that are suitable for DNA computing. We call this class of codes reversible complement cyclic codes. We use this theory to study all such codes of lengths 7, 9, 11 and 13. We list the codes that have the largest number of codewords for a given minimum Hamming distance. We show that some of these codes have more codewords than previously known codes with the same minimum Hamming distance.

Original languageEnglish
Pages (from-to)448-457
Number of pages10
JournalJournal of the Franklin Institute
Issue number4-5
Publication statusPublished - 1 Jul 2006



  • DNA computing
  • Hamming distance
  • Reversible complement cyclic codes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Signal Processing
  • Computer Networks and Communications
  • Applied Mathematics

Cite this