On a generalization of lifted polynomials over finite fields and their applications to DNA codes
From MaRDI portal
Publication:3451410
DOI10.1080/00207160.2014.930449zbMath1349.94128OpenAlexW2088357423WikidataQ58473312 ScholiaQ58473312MaRDI QIDQ3451410
Publication date: 16 November 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.930449
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Protein sequences, DNA sequences (92D20) Prefix, length-variable, comma-free codes (94A45)
Related Items (7)
A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ New computational and statistical models in science and economics ⋮ Reversible DNA codes using skew polynomial rings ⋮ Cyclic codes over \(\mathbb{F}_2 +u\mathbb{F}_2 +v\mathbb{F}_2 +v^2 \mathbb{F}_2\) with respect to the homogeneous weight and their applications to DNA codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Cyclic codes over \(\mathbb F_2[u/(u^4-1)\) and applications to DNA codes]
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Exordium for DNA codes
- Linear constructions for DNA codes
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Lifted polynomials over F16 and their applications to DNA codes
- Reversible codes
This page was built for publication: On a generalization of lifted polynomials over finite fields and their applications to DNA codes
