Construction of DNA codes by using algebraic number theory
From MaRDI portal
(Redirected from Publication:897343)
Recommendations
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Cyclic codes over \(\mathbb F_2[u]/(u^4-1)\) and applications to DNA codes
- Linear constructions for DNA codes
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
- DNA codes based on additive self-dual codes over \(\mathrm{GF}(4)\)
Cites work
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- Bounds for DNA codes with constant GC-content
- Calculation of certain Gauss sums
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- DNA codes for additive stem similarity
- DNA codes for nonadditive stem similarity
- DNA sequence design using templates
- Exordium for DNA codes
- Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Linear constructions for DNA codes
- On DNA codes
- Quadratic Gauss sums
- Reversible codes
- Weights of irreducible cyclic codes
Cited in
(4)
This page was built for publication: Construction of DNA codes by using algebraic number theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897343)
