Reversible complement cyclic codes over Galois rings with application to DNA codes
From MaRDI portal
Publication:2181254
DOI10.1016/j.dam.2020.01.004zbMath1470.94110OpenAlexW3003618300MaRDI QIDQ2181254
Ranjeet Sehmi, Jasbir Kaur, Sucheta Dutt
Publication date: 18 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.004
Related Items (3)
On reversible codes over a non-chain ring ⋮ Unnamed Item ⋮ Reversible cyclic codes over some finite rings and their application to DNA codes
Cites Work
- Unnamed Item
- Unnamed Item
- 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]
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\)
- Linear constructions for DNA codes
- Cyclic codes over the ring \(\mathbb{Z}_p [u, v / \langle u^2, v^2, u v - v u \rangle\)]
- 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
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Cyclic Codes over Galois Rings
- Coding and Cryptography
This page was built for publication: Reversible complement cyclic codes over Galois rings with application to DNA codes
