A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u] /(u^{2 k} - 1)\)
From MaRDI portal
Publication:2363327
DOI10.1016/j.ffa.2017.04.001zbMath1405.94113OpenAlexW2605520985MaRDI QIDQ2363327
Elif Segah Oztas, Bahattin Yildiz, Siap, Irfan
Publication date: 13 July 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2017.04.001
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (5)
Polycyclic codes associated with trinomials: good codes and open questions ⋮ Reversible \(G^k\)-codes with applications to DNA codes ⋮ Unnamed Item ⋮ Good classical and quantum codes from multi-twisted codes ⋮ Unnamed Item
Uses Software
Cites Work
- 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\) and constant \(GC\)-content
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Bounds for DNA codes with constant GC-content
- Linear constructions for DNA codes
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- 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
- On a generalization of lifted polynomials over finite fields and their applications to DNA codes
- Improved Lower Bounds for Constant GC-Content DNA Codes
- Reversible codes
This page was built for publication: A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u] /(u^{2 k} - 1)\)
