Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
From MaRDI portal
Publication:764895
DOI10.1016/J.DISC.2011.11.021zbMath1233.94037OpenAlexW2055688407MaRDI QIDQ764895
Derek H. Smith, Stephanie Perkins, Niema Aboluion
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.021
Related Items (10)
A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ On a generalization of lifted polynomials over finite fields and their applications to DNA codes ⋮ Reversible \(G^k\)-codes with applications to DNA codes ⋮ Quasi-cyclic codes: algebraic properties and applications ⋮ Reversible complement cyclic codes over Galois rings with application to DNA codes ⋮ Unnamed Item ⋮ Construction of DNA codes by using algebraic number theory ⋮ Construction of single-deletion-correcting DNA codes using CIS codes ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ Greedy construction of DNA codes and new bounds
Uses Software
Cites Work
This page was built for publication: Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint