Construction of DNA codes by using algebraic number theory
From MaRDI portal
Publication:897343
DOI10.1016/j.ffa.2015.10.008zbMath1400.94191OpenAlexW2217792622MaRDI QIDQ897343
Jing Li, Haseeb Ahmad, Haibo Hong, Changzhong Wu, Yi-Xian Yang, Li-Cheng Wang
Publication date: 17 December 2015
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2015.10.008
Linear codes (general theory) (94B05) Finite fields (field-theoretic aspects) (12E20) Cyclic codes (94B15)
Related Items (2)
Quasi-cyclic codes: algebraic properties and applications ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\)
Cites Work
- Unnamed Item
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content
- Calculation of certain Gauss sums
- DNA sequence design using templates
- DNA codes for additive stem similarity
- 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
- Quadratic Gauss sums
- Bounds for DNA codes with constant GC-content
- Exordium for DNA codes
- Linear constructions for DNA codes
- Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes
- DNA codes for nonadditive stem similarity
- On DNA codes
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Reversible codes
- Weights of irreducible cyclic codes
This page was built for publication: Construction of DNA codes by using algebraic number theory
