Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content
From MaRDI portal
Publication:539879
DOI10.1016/J.DISC.2010.03.005zbMATH Open1215.94087OpenAlexW2009266565MaRDI QIDQ539879FDOQ539879
Authors: Derek H. Smith, Niema Aboluion, Roberto Montemanni, Stephanie Perkins 
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
Recommendations
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Bounds for DNA codes with constant GC-content
- Linear constructions for DNA codes
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- Improved Lower Bounds for Constant GC-Content DNA Codes
- Greedy construction of DNA codes and new bounds
- On codeword design in metric DNA spaces
- Genetic code, Hamming distance and stochastic matrices
- A method for constructing DNA codes from additive self-dual codes over \(\mathrm{GF}(4)\)
- Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum error correction via codes over GF(4)
- Linear constructions for DNA codes
- Bounds for DNA codes with constant GC-content
- Modular and \(p\)-adic cyclic codes
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- An ant colony optimization algorithm for DNA sequencing by hybridization
Cited In (13)
- Testing whether a set of code words satisfies a given set of constraints
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\)
- Improved Lower Bounds for Constant GC-Content DNA Codes
- A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u] /(u^{2 k} - 1)\)
- Greedy construction of DNA codes and new bounds
- On conflict free DNA codes
- Linear constructions for DNA codes
- Bounds for DNA codes with constant GC-content
- Construction of DNA codes by using algebraic number theory
- Unconventional construction of DNA codes: group homomorphism
- New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes
Uses Software
This page was built for publication: Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539879)
