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

Taher Abualrub, Ali Ghrayeb, Xiang Nian Zeng

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

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
JournalMetal Finishing
Volume104
Issue number6
DOIs
Publication statusPublished - Jun 2006
Externally publishedYes

Fingerprint

Hamming distance
DNA
code

Keywords

  • DNA computing
  • Hamming distance
  • Reversible complement cyclic codes

ASJC Scopus subject areas

  • Materials Science(all)
  • Metals and Alloys

Cite this

Construction of cyclic codes over GF (4) for DNA computing. / Abualrub, Taher; Ghrayeb, Ali; Nian Zeng, Xiang.

In: Metal Finishing, Vol. 104, No. 6, 06.2006, p. 448-457.

Research output: Contribution to journalArticle

Abualrub, Taher ; Ghrayeb, Ali ; Nian Zeng, Xiang. / Construction of cyclic codes over GF (4) for DNA computing. In: Metal Finishing. 2006 ; Vol. 104, No. 6. pp. 448-457.
@article{a925d6455a9e445795cb84357c58523f,
title = "Construction of cyclic codes over GF (4) for DNA computing",
abstract = "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.",
keywords = "DNA computing, Hamming distance, Reversible complement cyclic codes",
author = "Taher Abualrub and Ali Ghrayeb and {Nian Zeng}, Xiang",
year = "2006",
month = "6",
doi = "10.1016/j.jfranklin.2006.02.009",
language = "English",
volume = "104",
pages = "448--457",
journal = "Metal Finishing",
issn = "0026-0576",
publisher = "Elsevier USA",
number = "6",

}

TY - JOUR

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

AU - Abualrub, Taher

AU - Ghrayeb, Ali

AU - Nian Zeng, Xiang

PY - 2006/6

Y1 - 2006/6

N2 - 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.

AB - 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.

KW - DNA computing

KW - Hamming distance

KW - Reversible complement cyclic codes

UR - http://www.scopus.com/inward/record.url?scp=33748073424&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748073424&partnerID=8YFLogxK

U2 - 10.1016/j.jfranklin.2006.02.009

DO - 10.1016/j.jfranklin.2006.02.009

M3 - Article

AN - SCOPUS:33747787670

VL - 104

SP - 448

EP - 457

JO - Metal Finishing

JF - Metal Finishing

SN - 0026-0576

IS - 6

ER -