Reversible \(G^k\)-codes with applications to DNA codes
From MaRDI portal
Publication:2153759
DOI10.1007/s10623-022-01067-7OpenAlexW3189456235WikidataQ114849708 ScholiaQ114849708MaRDI QIDQ2153759
Adrian Korban, Deniz Ustun, Serap Sahinkaya
Publication date: 13 July 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.02033
Cites Work
- Unnamed Item
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- The Magma algebra system. I: The user language
- Bounds for DNA codes with constant GC-content
- Group rings, \(G\)-codes and constructions of self-dual and formally self-dual codes
- Linear constructions for DNA codes
- Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\)
- New singly and doubly even binary \([72,36,12\) self-dual codes from \(M_2(R)G\)-group matrix rings]
- A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)]
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing
- Reversible \(G\)-codes over the ring \(\mathcal{F}_{j, k}\) with applications to DNA codes
This page was built for publication: Reversible \(G^k\)-codes with applications to DNA codes