Quantum synchronizable codes through generalized cyclotomy of order 2r over Z2n
Manju Pruthimanju.pruthi@yahoo.comDepartment of MathematicsMeerpurIndira Gandhi UniversityRewari, Haryana, 122502, IndiaView full profile → , *Arun Kumar YadavCorresponding authorarun.math.rs@igu.ac.inSchool of Basic and Applied SciencesK. R. Mangalam UniversitySohna Road, Haryana, IndiaView full profile → , Pooja Sonipooja.math.rs@igu.ac.inDepartment of MathematicsMeerpurIndira Gandhi UniversityRewari, Haryana, 122502, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Feb 2025
- Published Online:
- 04 Jul 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-2382
- Pages:
- 2205–2216
Abstract
In this work, we introduce the construction of a generalized cyclotomic class of order 2r over Z2n, and the work further shows that the resulting codes are cyclic codes containing their dual, along with their augmented counterparts. In addition, the research provides a comprehensive analysis of two categories of quantum synchronization capabilities that can reach their maximum potential in specific circumstances. The error correction capacity of the proposed quantum synchronizable codes includes both bit errors and phase errors.
Keywords
Subject Classifications
References
[1] T. Wang, T. Yan, V. Sidorenko, and X. Wang, “Quantum synchronizable codes from cyclotomic classes of order two over Z_(2q),” arXiv preprint arXiv:2106.02470, pp. 1–9 (2021).
[2] Y. Fujiwara, “Block synchronization for quantum information,” Phys. Rev. A - At. Mol. Opt. Phys., vol. 87, no. 2 (2013), doi: 10.1103/PhysRevA.87.022344.
[3] Y. Fujiwara, V. D. Tonchev, and T. W. H. Wong, “Algebraic techniques in designing quantum synchronizable codes,” Phys. Rev. A, vol. 88, no. 1, p. 012318 (Jul. 2013), doi: 10.1103/PhysRevA.88.012318.
[4] Y. Fujiwara and P. Vandendriessche, “Quantum Synchronizable Codes From Finite Geometries,” IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 7345–7354 (Nov. 2014), doi: 10.1109/TIT.2014.2357029.
[5] L. Li, S. Zhu, and L. Liu, “Quantum Synchronizable Codes From the Cyclotomy of Order Four,” IEEE Commun. Lett., vol. 23, no. 1, pp. 12–15 (2019), doi: 10.1109/LCOMM.2018.2877989.
[6] B. Pang, S. Zhu, J. Li, and L. Li, “New Quantum Codes Derived from Cyclic Codes,” Int. J. Theor. Phys., vol. 59, no. 4, pp. 1058–1068 (2020), doi: 10.1007/s10773-020-04388-2.
[7] T. Wang, T. Yan, V. Sidorenko, and X. Wang, “Quantum Synchronizable Codes From Cyclotomic Classes of Order Two over Z2q,” https://arxiv.org/abs/2106.02470, pp. 1–9 (2021).
[8] H. Q. Dinh, B. T. Nguyen, and W. Yamaka, “Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2 p s Over F p m,” IEEE Access, vol. 8, pp. 124608–124623 (2020), doi: 10.1109/ACCESS.2020.3006001.
[9] N. Annamalai and C. Durairajan, “Exponent of cyclic codes over Fq,” J. Discret. Math. Sci. Cryptogr., vol. 26, no. 1, pp. 115–120 (2023), doi: 10.1080/09720529.2021.1933707.
[10] L. Heboub and D. Mihoubi, “Minimal and maximal cyclic codes of length 2p,” J. Discret. Math. Sci. Cryptogr., vol. 27, no. 1, pp. 63–74 (2024), doi: 10.47974/JDMSC-1569.
[11] S. Bhowmick, J. de la Cruz, E. Martınez-Moro, and A. Sharma, “On LCP and checkable group codes over finite non-commutative Frobenius rings,” J. Discret. Math. Sci. Cryptogr., vol. 28, no. 3, pp. 891–905 (2025), doi: 10.47974/JDMSC-2187.
[12] A. K. Yadav, M. Pruthi, and V. Kumar, “Quantum Synchronizable Codes from Quaternary Cyclotomy over Z2n,” Int. J. Theor. Phys., vol. 62, no. 6, p. 112 (May 2023), doi: 10.1007/s10773-023-05390-0.
[13] W. Bosma, J. Cannon, and C. Playoust, “The Magma Algebra System I : The User Language †,” J. Symb. Comput., no. 24, pp. 235–265 (1997).
[14] A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF (4),” IEEE Trans. Inf. Theory, vol. 44, no. 4, pp. 1369–1387 (1998), doi: 10.1109/18.681315.
[15] L. Luo and Z. Ma, “Non-binary quantum synchronizable codes from repeated-root cyclic codes,” IEEE Trans. Inf. Theory, vol. 64, no. 3, pp. 1461–1470 (2018), doi: 10.1109/TIT.2018.2795479.
