Binary templates for comma-free DNA codes

Arita and Kobayashi proposed a method for constructing comma-free DNA codes using binary templates, and showed that the separation d of any such binary template of length n satisfies d n/2. Kobayashi, Kondo and Arita later produced an infinite family of binary templates with d 11n/30. Here we demonstrate the existence of an infinite family of binary templates with d > n/2 − (18n loge n)1/2. We also give an explicit construction for an infinite family of binary templates with d > n/2 − 19n1/2 loge n. © 2006 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2007
• Where: DAM
• Authors: Oliver D. King, Philippe Gaborit
• Keywords: Binary Templates, Comma-free Dna Codes, DAM 2007, Infinite Family