Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content

DOI10.1016/j.disc.2010.03.005zbMath1215.94087OpenAlexW2009266565MaRDI QIDQ539879

Stephanie Perkins, Roberto Montemanni, Derek H. Smith, Niema Aboluion

Publication date: 31 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.005

zbMATH Keywords

cyclic codesDNA codesconstant \(GC\)-content

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Cyclic codes (94B15)

Related Items (5)

A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ Construction of DNA codes by using algebraic number theory ⋮ Greedy construction of DNA codes and new bounds ⋮ On conflict free DNA codes ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
• Bounds for DNA codes with constant GC-content
• Linear constructions for DNA codes
• Modular and \(p\)-adic cyclic codes
• An ant colony optimization algorithm for DNA sequencing by hybridization
• Quantum error correction via codes over GF(4)

This page was built for publication: Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content