Research article

Additive conjucyclic codes over $ \mathbb{F}_{q^2} $: Trace correspondence and applications to quantum codes

  • Published: 24 July 2026
  • MSC : 11T71, 94B05

  • Additive conjucyclic codes over $ \mathbb{F}_{q^2} $ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general finite fields has been lacking. In this paper, we develop a unified framework by establishing a trace-based $ \mathbb{F}_q $-linear isomorphism between $ \mathbb{F}_{q^2}^n $ and $ \mathbb{F}_q^{2n} $. This correspondence shows that additive conjucyclic codes of length $ n $ correspond bijectively to $ q $-ary linear cyclic codes of length $ 2n $, translating their structural analysis to the well-understood setting of cyclic codes. Using this isomorphism, we determine the enumeration of such codes and give explicit forms of their generator matrices. We then introduce an alternating inner product on $ \mathbb{F}_{q^2}^n $, which is shown to be compatible with the symplectic inner product on $ \mathbb{F}_q^{2n} $ under the trace isomorphism. Based on this inner product, we characterize the dual-containing condition for additive conjucyclic codes and derive explicit parity-check matrices. Finally, we construct $ q $-ary QECCs from dual-containing additive conjucyclic codes. Our results unify and generalize previous studies on quaternary additive conjucyclic codes and present a construction method for $ q $-ary QECCs from additive conjucyclic codes, together with an illustrative example.

    Citation: Jingjie Lv, Xian Lian, Ruihu Li, Hanxu Hou. Additive conjucyclic codes over $ \mathbb{F}_{q^2} $: Trace correspondence and applications to quantum codes[J]. AIMS Mathematics, 2026, 11(7): 22097-22113. doi: 10.3934/math.2026894

    Related Papers:

  • Additive conjucyclic codes over $ \mathbb{F}_{q^2} $ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general finite fields has been lacking. In this paper, we develop a unified framework by establishing a trace-based $ \mathbb{F}_q $-linear isomorphism between $ \mathbb{F}_{q^2}^n $ and $ \mathbb{F}_q^{2n} $. This correspondence shows that additive conjucyclic codes of length $ n $ correspond bijectively to $ q $-ary linear cyclic codes of length $ 2n $, translating their structural analysis to the well-understood setting of cyclic codes. Using this isomorphism, we determine the enumeration of such codes and give explicit forms of their generator matrices. We then introduce an alternating inner product on $ \mathbb{F}_{q^2}^n $, which is shown to be compatible with the symplectic inner product on $ \mathbb{F}_q^{2n} $ under the trace isomorphism. Based on this inner product, we characterize the dual-containing condition for additive conjucyclic codes and derive explicit parity-check matrices. Finally, we construct $ q $-ary QECCs from dual-containing additive conjucyclic codes. Our results unify and generalize previous studies on quaternary additive conjucyclic codes and present a construction method for $ q $-ary QECCs from additive conjucyclic codes, together with an illustrative example.



    加载中


    [1] P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Repts. Suppl., 10 (1973).
    [2] A. R. Calderbank, E. M. Rains, P. W. Shor, N. J. A. Sloane, Quantum error correction via GF(4), IEEE Trans. Inf. Theory, 44 (1998), 1369–1387. http://dx.doi.org/10.1109/18.681315 doi: 10.1109/18.681315
    [3] K. Abdukhalikov, D. Ho, On the equivalence between additive and linear codes, arXiv: 2603.15071, 2026. https://doi.org/10.48550/arXiv.2603.15071
    [4] S. Bhowmick, K. Deka, A. F. Tabue, E. Martínez-Moro, Trace duality and additive complementary pairs of additive cyclic codes over finite chain rings, Finite Fields Appl., 110 (2026), 102732. http://dx.doi.org/10.1016/j.ffa.2025.102732 doi: 10.1016/j.ffa.2025.102732
    [5] M. Shi, N. Liu, J. L. Kim, P. Solé, Additive complementary dual codes over $\mathbb{F}_4$, Des. Codes Cryptogr., 91 (2023), 273–284. https://doi.org/10.1007/s10623-022-01106-3 doi: 10.1007/s10623-022-01106-3
    [6] W. C. Huffman, Additive cyclic codes over $\mathbb{F}_4$, Adv. Math. Commun., 1 (2007), 427–459. http://dx.doi.org/10.3934/amc.2007.1.427 doi: 10.3934/amc.2007.1.427
    [7] J. Bierbrauer, Cyclic additive codes, J. Algebra, 372 (2012), 661–672. http://dx.doi.org/10.1016/j.jalgebra.2012.08.031 doi: 10.1016/j.jalgebra.2012.08.031
    [8] C. Güneri, F. Özbudak, F. Özdemir, On complementary dual additive cyclic codes, Adv. Math. Commun., 11 (2017), 353–357. https://doi.org/10.3934/amc.2017028 doi: 10.3934/amc.2017028
    [9] M. Shi, R. Wu, P. Sole, Asymptotically good additive cyclic codes exist, IEEE Commun. Lett., 22 (2018), 1980–1983. https://doi.org/10.1109/LCOMM.2018.2863370 doi: 10.1109/LCOMM.2018.2863370
    [10] R. Dastbasteh, K. Shivji, Polynomial representation of additive cyclic codes and new quantum codes, Adv. Math. Commun., 19 (2025), 49–68. https://doi.org/10.3934/amc.2023036 doi: 10.3934/amc.2023036
    [11] T. Abualrub, Y. Cao, S. T. Dougherty, Algebraic structure of additive conjucyclic codes over $\mathbb{F}_4$, Finite Fields Appl., 65 (2020), 101678. http://dx.doi.org/10.1016/j.ffa.2020.101678 doi: 10.1016/j.ffa.2020.101678
    [12] T. Abualrub, S. T. Dougherty, Additive and linear conjucyclic codes over $\mathbb{F}_4$, Adv. Math. Commun., 16 (2022), 1–15. https://doi.org/10.3934/amc.2020096 doi: 10.3934/amc.2020096
    [13] W. C. Huffman, V. Pless, Fundamentals of error-correcting codes, Cambridge University Press, 2003. https://doi.org/10.1017/CBO9780511807077
    [14] G. Castagnoli, J. L. Massey, P. A. Schoeller, N. von Seeman, On repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37 (1991), 337–342. https://doi.org/10.1109/18.75249 doi: 10.1109/18.75249
    [15] W. Bosma, J. Cannon, C. Playoust, The MAGMA algebra system Ⅰ: The user language, J. Symb. Comput., 24 (1997), 235–265. https://doi.org/10.1006/jsco.1996.0125 doi: 10.1006/jsco.1996.0125
    [16] Z. Heng, C. Li, X. Wang, Constructions of MDS, near MDS and almost MDS codes from cyclic subgroups of $\mathbb{F}^*_{q^2}$, IEEE Trans. Inf. Theory, 68 (2022), 7817–7831. http://dx.doi.org/10.1109/TIT.2022.3194914 doi: 10.1109/TIT.2022.3194914
    [17] C. Ding, C. Tang, Infinite families of near MDS codes holding t-designs, IEEE Trans. Inf. Theory, 66 (2020), 5419–5428. http://dx.doi.org/10.1109/TIT.2020.2990396 doi: 10.1109/TIT.2020.2990396
    [18] A. Ashikhmin, E. Knill, Nonbinary quantum stabilizer codes, IEEE Trans. Inf. Theory, 47 (2001), 3065–3072. https://doi.org/10.1109/18.959288 doi: 10.1109/18.959288
    [19] A. Ketkar, A. Klappenecker, S. Kumar, P. K. Sarvepalli, Nonbinary stabilizer codes over finite fields, IEEE Trans. Inf. Theory, 52 (2006), 4892–4914. https://doi.org/10.1109/TIT.2006.883612 doi: 10.1109/TIT.2006.883612
    [20] K. Feng, Z. Ma, A finite Gilbert–Varshamov bound for pure stabilizer quantum codes, IEEE Trans. Inf. Theory, 50 (2004), 3323–3325. https://doi.org/10.1109/TIT.2004.838088 doi: 10.1109/TIT.2004.838088
    [21] Y. Edel, Table of quantum twisted codes, 2026. Available from: https://www.yvesedel.de/Matritzen/QTBCH/QTBCHIndex.html.
    [22] M. Grassl, Code tables: Bounds on the parameters of various types of codes, 2026. Available from: http://www.codetables.de.
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(46) PDF downloads(4) Cited by(0)

Article outline

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog