This paper studies cyclic, quantum, and DNA codes over the mixed-characteristic ring $ \mathcal{R}_{p, \alpha} = \mathbb{Z}_{p^{2}}[u]/\langle u^{2}-\alpha\rangle, $ where $ p $ is an odd prime and $ \alpha\in\mathbb{F}_{p}^{*} $. When $ \alpha $ is a quadratic residue modulo $ p $, the polynomial $ u^{2}-\alpha $ splits over $ \mathbb{Z}_{p^{2}} $ and $ \mathcal{R}_{p, \alpha} $ is a semi-local ring isomorphic to $ \mathbb{Z}_{p^{2}}\oplus\mathbb{Z}_{p^{2}} $. In this decomposable case, every $ \mathcal{R}_{p, \alpha} $-linear cyclic code admits a canonical idempotent decomposition into two cyclic codes over $ \mathbb{Z}_{p^{2}} $, leading to explicit descriptions of generator polynomials, dual codes, and Lee distances. Both the coprime-length case $ \gcd(n, p) = 1 $ and the repeated-root case $ n = p^{s} $ are analyzed, reflecting their distinct ideal-theoretic behavior. An $ \mathbb{F}_{p} $-linear Gray map is constructed that induces a Lee-to-Hamming isometry from $ \mathcal{R}_{p, \alpha}^{n} $ to $ \mathbb{F}_{p}^{4n} $. Using a compatible bilinear form, we show that the Gray image of a Euclidean self-orthogonal cyclic code remains symplectic self-orthogonal over $ \mathbb{F}_{p} $, which enables the construction of $ p $-ary quantum stabilizer codes via the Calderbank–Shor–Steane method. Explicit computations for small parameters illustrate the resulting quantum code parameters and show that several examples meet or improve known bounds. For $ p = 5 $, the Gray map also admits an interpretation suitable for DNA coding. By mapping Gray images to the IUPAC nucleotide alphabet and exploiting the ring involution $ u\mapsto -u $, we obtain reversible DNA codes through blockwise reversal symmetry. Using coterm polynomials, families of reversible DNA codes with prescribed minimum distance and controlled GC-content are constructed. These results demonstrate how cyclic codes over the mixed-characteristic ring $ \mathcal{R}_{p, \alpha} $ can be used to derive quantum and DNA codes through the Gray map and related algebraic structures.
Citation: Sami H. Saif, Shayea Aldossari. Quantum and DNA codes from cyclic codes over the ring $ \mathbb{Z}_{p^{2}}[u]/\langle u^{2}-\alpha\rangle $[J]. AIMS Mathematics, 2026, 11(3): 7497-7528. doi: 10.3934/math.2026307
This paper studies cyclic, quantum, and DNA codes over the mixed-characteristic ring $ \mathcal{R}_{p, \alpha} = \mathbb{Z}_{p^{2}}[u]/\langle u^{2}-\alpha\rangle, $ where $ p $ is an odd prime and $ \alpha\in\mathbb{F}_{p}^{*} $. When $ \alpha $ is a quadratic residue modulo $ p $, the polynomial $ u^{2}-\alpha $ splits over $ \mathbb{Z}_{p^{2}} $ and $ \mathcal{R}_{p, \alpha} $ is a semi-local ring isomorphic to $ \mathbb{Z}_{p^{2}}\oplus\mathbb{Z}_{p^{2}} $. In this decomposable case, every $ \mathcal{R}_{p, \alpha} $-linear cyclic code admits a canonical idempotent decomposition into two cyclic codes over $ \mathbb{Z}_{p^{2}} $, leading to explicit descriptions of generator polynomials, dual codes, and Lee distances. Both the coprime-length case $ \gcd(n, p) = 1 $ and the repeated-root case $ n = p^{s} $ are analyzed, reflecting their distinct ideal-theoretic behavior. An $ \mathbb{F}_{p} $-linear Gray map is constructed that induces a Lee-to-Hamming isometry from $ \mathcal{R}_{p, \alpha}^{n} $ to $ \mathbb{F}_{p}^{4n} $. Using a compatible bilinear form, we show that the Gray image of a Euclidean self-orthogonal cyclic code remains symplectic self-orthogonal over $ \mathbb{F}_{p} $, which enables the construction of $ p $-ary quantum stabilizer codes via the Calderbank–Shor–Steane method. Explicit computations for small parameters illustrate the resulting quantum code parameters and show that several examples meet or improve known bounds. For $ p = 5 $, the Gray map also admits an interpretation suitable for DNA coding. By mapping Gray images to the IUPAC nucleotide alphabet and exploiting the ring involution $ u\mapsto -u $, we obtain reversible DNA codes through blockwise reversal symmetry. Using coterm polynomials, families of reversible DNA codes with prescribed minimum distance and controlled GC-content are constructed. These results demonstrate how cyclic codes over the mixed-characteristic ring $ \mathcal{R}_{p, \alpha} $ can be used to derive quantum and DNA codes through the Gray map and related algebraic structures.
| [1] |
S. Zhu, Y. Wang, M. Shi, Some results on cyclic codes over $\mathbb{F}_2 + u\mathbb{F}_2$, IEEE Trans. Inform. Theory, 56 (2010), 1680–1684. https://doi.org/10.1109/TIT.2010.2040896 doi: 10.1109/TIT.2010.2040896
|
| [2] |
M. Ashraf, N. Khan, G. Mohammad, New quantum and LCD codes over finite fields of odd characteristic, Int. J. Theor. Phys., 60 (2021), 2322–2332. https://doi.org/10.1007/s10773-021-04849-2 doi: 10.1007/s10773-021-04849-2
|
| [3] |
X. Zeng, Y. Zhang, J. Gao, Linear codes from defining sets over $\mathbb{F}_p + u\mathbb{F}_p$ and their applications, Comput. Appl. Math., 43 (2024), 13. https://doi.org/10.1007/s40314-023-02527-z doi: 10.1007/s40314-023-02527-z
|
| [4] |
A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, P. Solé, The $\mathbb{Z}_4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory, 40 (1994), 301–319. https://doi.org/10.1109/18.312154 doi: 10.1109/18.312154
|
| [5] |
M. Ashraf, G. Mohammad, Quantum codes from cyclic codes over $\mathbb{F}_q + u\mathbb{F}_q + v\mathbb{F}_q + uv\mathbb{F}_q$, Quantum Inf. Process., 15 (2016), 4089–4098. https://doi.org/10.1007/s11128-016-1379-8 doi: 10.1007/s11128-016-1379-8
|
| [6] |
B. Yildiz, I. Siap, Cyclic codes over $\mathbb{F}_2[u]/(u^4 - 1)$ and applications to DNA codes, Comput. Math. Appl., 63 (2012), 1169–1176. https://doi.org/10.1016/j.camwa.2011.12.029 doi: 10.1016/j.camwa.2011.12.029
|
| [7] | J. Qian, W. Ma, W. Gou, Quantum codes from cyclic codes over finite rings, Int. J. Quantum Inf., 50 (2009), 1277–1283. |
| [8] |
X. Kai, S. Zhu, Quaternary construction of quantum codes from cyclic codes over $\mathbb{F}_4 + u\mathbb{F}_4$, Int. J. Quant. Inf., 9 (2011), 689–700. https://doi.org/10.1142/s0219749911007757 doi: 10.1142/s0219749911007757
|
| [9] |
J. Gao, Quantum codes from cyclic codes over $\mathbb{F}_q + v\mathbb{F}_q + v^2\mathbb{F}_q + v^3\mathbb{F}_q$, Int. J. Quant. Inf., 13 (2015), 1550063. https://doi.org/10.1142/S021974991550063X doi: 10.1142/S021974991550063X
|
| [10] |
S. H. Saif, Constructions and enumerations of self-dual and LCD double circulant codes over a local ring, Mathematics, 13 (2025), 3527. https://doi.org/10.3390/math13213527 doi: 10.3390/math13213527
|
| [11] |
H. Q. Dinh, A. K. Singh, S. Pattanayak, S. Sriboonchitta, Construction of cyclic DNA codes over the ring $\mathbb{Z}_4[u]/\langle u^2 - 1\rangle$ based on the deletion distance, Theor. Comput. Sci., 773 (2019), 27–42. https://doi.org/10.1016/j.tcs.2018.06.002 doi: 10.1016/j.tcs.2018.06.002
|
| [12] |
H. Q. Dinh, A. K. Singh, S. Pattanayak, S. Sriboonchitta, Cyclic DNA codes over the ring $\mathbb{F}_2 + u\mathbb{F}_2 + v\mathbb{F}_2 + uv\mathbb{F}_2 + v^2\mathbb{F}_2 + uv^2\mathbb{F}_2$, Des. Codes Cryptogr., 86 (2018), 1451–1467. https://doi.org/10.1007/s10623-017-0405-x doi: 10.1007/s10623-017-0405-x
|
| [13] |
E. S. Oztas, B. Yildiz, I. Siap, A novel approach for constructing reversible codes and applications to DNA codes over the ring $\mathbb{F}_2[u]/(u^2k-1)$, Finite Fields Appl., 46 (2017), 217–234. https://doi.org/10.1016/j.ffa.2017.04.001 doi: 10.1016/j.ffa.2017.04.001
|
| [14] |
S. H. Saif, Structures, ranks and minimal distances of cyclic codes over $\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}$, Mathematics, 13 (2025), 3354. https://doi.org/10.3390/math13203354 doi: 10.3390/math13203354
|
| [15] |
S. Alabiad, A. A. Alhomaidhi, Various structures of cyclic codes and LCD codes over $\mathrm{GR}(p^{3}, m)[v]/\langle v^{2} - p^{2}\alpha, pv \rangle$, AIMS Math., 10 (2025), 27535–27559. https://doi.org/10.3934/math.20251211 doi: 10.3934/math.20251211
|
| [16] |
S. Ali, S. A. Alali, E. S. Oztas, P. Sharma, Construction of quantum codes over the class of commutative rings and their applications to DNA codes, Mathematics, 11 (2023), 1430. https://doi.org/10.3390/math11061430 doi: 10.3390/math11061430
|
| [17] | H. Q. Dinh, S. Pathak, A. K. Upadhyay, W. Yamaka, New DNA codes from cyclic codes over mixed alphabets, Mathematics, 8 (2020) 1977. https://doi.org/10.3390/math8111977 |
| [18] |
P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, 52 (1995), 2493–2496. https://doi.org/10.1103/PhysRevA.52.R2493 doi: 10.1103/PhysRevA.52.R2493
|
| [19] |
A. R. Calderbank, E. M. Rains, P. M. Shor, N. J. A. Sloane, Quantum error-correction via codes over GF(4), IEEE Trans. Inform. Theory, 44 (1998), 1369–1387. https://doi.org/10.1109/18.681315 doi: 10.1109/18.681315
|
| [20] |
H. Islam, O. Prakash, New quantum and LCD codes over finite fields of even characteristic, Def. Sci. J., 71 (2020), 656–661. https://doi.org/10.14429/dsj.71.16641 doi: 10.14429/dsj.71.16641
|
| [21] |
M. Özen, N. T. Özzaim, H. Ince, Quantum codes from cyclic codes over $\mathbb{F}_3 + u\mathbb{F}_3 + v\mathbb{F}_3 + uv\mathbb{F}_3$, J. Phys.: Conf. Ser., 766 (2016), 012020. https://doi.org/10.1088/1742-6596/766/1/012020 doi: 10.1088/1742-6596/766/1/012020
|
| [22] |
M. Ashraf, G. Mohammad, Quantum codes over $\mathbb{F}_p$ from cyclic codes over $\mathbb{F}_p[u, v]/\langle u^2 - 1, v^3 - v, uv - vu\rangle$, Cryptogr. Commun., 11 (2019), 325–335. https://doi.org/10.1007/s12095-018-0299-0 doi: 10.1007/s12095-018-0299-0
|
| [23] |
H. Islam, O. Prakash, Construction of LCD and new quantum codes from cyclic codes over a finite non-chain ring, Cryptogr. Commun., 14 (2022), 59–73. https://doi.org/10.1007/s12095-021-00516-9 doi: 10.1007/s12095-021-00516-9
|
| [24] | M. Grassl, Code tables: bounds on the parameters of various types of codes. Available from: http://www.codetables.de/. |
| [25] | M. Grassl, T. Beth, M. Rötteler, On optimal quantum codes, Int. J. Quant. Inf., 2 (2004), 55–64. https://doi.org/10.1142/s0219749904000079 |
| [26] | A. Marathe, A. E. Condon, R. M. Corn, On combinatorial DNA word design, J. Comput. Biol., 8 (2001), 201–220. |
| [27] |
A. D. Johnson, An extended IUPAC nomenclature code for polymorphic nucleic acids, Bioinformatics, 26 (2010), 1386–1389. https://doi.org/10.1093/bioinformatics/btq098 doi: 10.1093/bioinformatics/btq098
|
| [28] | O. D. King, Bounds for DNA codes with constant GC-content, Electron. J. Comb., 10 (2003), R33. |
| [29] |
M. Li, H. J. Lee, A. E. Condon, R. M. Corn, DNA word design strategy for creating sets of non-interacting oligonucleotides for DNA microarrays, Langmuir, 18 (2002), 805–812. https://doi.org/10.1021/la0112209 doi: 10.1021/la0112209
|
| [30] |
T. Abualrub, A. Ghrayeb, X. Zeng, Construction of cyclic codes over GF(4) for DNA computing, J. Franklin Inst., 343 (2006), 448–457. https://doi.org/10.1016/j.jfranklin.2006.02.009 doi: 10.1016/j.jfranklin.2006.02.009
|
| [31] |
I. Siap, T. Abualrub, A. Ghrayeb, Cyclic DNA codes over the ring $\mathbb{F}_2[u]/(u^2 - 1)$ based on the deletion distance, J. Franklin Inst., 346 (2009), 731–740. https://doi.org/10.1016/j.jfranklin.2009.07.002 doi: 10.1016/j.jfranklin.2009.07.002
|
| [32] |
K. Gowdhaman, S. Gupta, C. Mohan, K. Guenda, D. Chinnapillai, Cyclic DNA codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + u^2\mathbb{Z}_4$, J. Algebra Comb. Discrete Appl., 8 (2021), 219–231. https://doi.org/10.13069/jacodesmath.1000959 doi: 10.13069/jacodesmath.1000959
|
| [33] | W. Bosma, J. Cannon, Handbook of Magma functions, University of Sydney, 1995. |