Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing
From MaRDI portal
Publication:6059077
DOI10.1142/s1793830922501579OpenAlexW4296209327WikidataQ114071624 ScholiaQ114071624MaRDI QIDQ6059077
Wateekorn Sriwirach, Chakkrid Klin-eam
Publication date: 2 November 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922501579
Cites Work
- On cyclic DNA codes over \({\mathbb {F}}_2+u{\mathbb {F}}_2\)
- Codes over \(\mathbb F_{4}+v\mathbb F_4\) and some DNA applications
- Cyclic codes over \(\mathbb F_2[u/(u^4-1)\) and applications to DNA codes]
- Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance]
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- On cyclic codes over \(\mathbb{Z}_4\) + \(u\mathbb{Z}_4\) and their \(\mathbb{Z}_4\)-images
- Bounds for DNA codes with constant GC-content
- Exordium for DNA codes
- Linear constructions for DNA codes
- A study of cyclic and constacyclic codes over \(\mathbb Z_{4} + u\mathbb Z_{4} + v\mathbb Z_{4}\)
- Linear codes over \(\mathbb Z_4+u\mathbb Z_4\): MacWilliams identities, projections, and formally self-dual codes
- Cyclic codes over the rings \(\mathbb Z_2 + u\mathbb Z_2\) and \(\mathbb Z_2 + u\mathbb Z_2 + u^2 \mathbb Z_2\)
- Construction of cyclic DNA codes over the ring \(\mathbb{Z}_4 [u / \langle u^2 - 1 \rangle\) based on the deletion distance]
- Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Reversible Codes and Applications to DNA
- Quasi-cyclic codes over the ring 𝔽p[u/〈u2 − u〉]
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- On cyclic DNA codes over the rings Z4 + wZ4 and Z4 + wZ4 + vZ4 + wvZ4
- Cyclic codes and quadratic residue codes over Z/sub 4/
This page was built for publication: Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing
