Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2007.03963 · AIMS Mathematics

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

Jingjie Lv, 廉贤, Ruihu Li, Hanxu Hou

Published Jan 1, 2026• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3934/math.2026894

Related papers

Additive conjucyclic codes over a class of Galois rings

Habibul Islam, Dipak K. Bhunia

Abstract As a tool towards quantum error correction, additive conjucyclic codes have gained great attention. But, their algebraic structure is completely unknown over finite fields (except $${\mathbb {F}}_{q^2}$$ Fq2 ) as well as rings. In this article, we investigate the structure of additive conjucyclic codes over Galois rings $$GR(2^r,2)$$ GR(2r,2) , where $$r\ge 2$$ r≥2 is an integer. We develop a one-to-one correspondence between the family of additive conjucyclic codes of lengthnover $$GR(2^r,2)$$ GR(2r,2) and the family of linear cyclic codes of length 2nover $${\mathbb {Z}}_{2^r}$$ Z2r . This correspondence helps to obtain additive conjucyclic codes over $$GR(2^r,2)$$ GR(2r,2) via known linear cyclic codes over $${\mathbb {Z}}_{2^r}$$ Z2r . We prove that the trace dual $${\mathscr {C}}^{Tr}$$ CTr of an additive conjucyclic code $${\mathscr {C}}$$ C is also an additive conjucyclic code. Moreover, we derive a necessary and sufficient condition of additive conjucyclic codes to be self-dual. We further propose a technique for constructing linear cyclic codes over $${\mathbb {Z}}_{2^r}$$ Z2r contained in additive conjucyclic codes over $$GR(2^r,2)$$ GR(2r,2) . Last but not least, we explicitly derive the generator matrices for these codes.

Journal of Applied Mathematics and Computing•Dec 21, 2023•1 citation

Quaternary conjucyclic codes with an application to EAQEC codes

Md Ajaharul Hossain, Ramakrishna Bandi

Conjucyclic codes are part of a family of codes that includes cyclic, constacyclic, and quasi-cyclic codes, among others. Despite their importance in quantum error correction, they have not received much attention in the literature. This paper focuses on additive conjucyclic (ACC) codes over $ \mathbb{F}_4 $ and investigates their properties. Specifically, we derive the duals of ACC codes by using a trace inner product and obtain the trace hull and its dimension. Also, we establish a necessary and sufficient condition for an additive code to have a complementary dual (ACD). Additionally, we identify a necessary condition for an additive conjucyclic complementary pair of codes over $ \mathbb{F}_4 $. Furthermore, we show that the trace code of an ACC code is cyclic and provide a condition for the trace code of an ACC code to be LCD. To demonstrate the practical application of our findings, we construct some good entanglement-assisted quantum error-correcting (EAQEC) codes using the trace code of ACC codes.

arXiv:2309.01983•Advances in Mathematics of Communications•Mar 5, 2024•1 citation

Quantum constacyclic codes

Xinmei Wang

A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,one method for constructing quantum constacyclic codes is presented by finding self-orthogonal classical constacyclic codes over the field GF(4) under a trace inner product.Finally,some examples are given.As an application of this method,quantum Hamming codes are constructed.This class of quantum codes includes well-known quantum cyclic codes.

Journal of Xidian University•Jan 1, 2009•0 citations

$ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $ -cyclic codes over $ \mathbb{F}_q^l $ and their application to construct quantum codes

Akanksha Tiwari, Anuj Kumar Bhagat, Ritumoni Sarma

In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.

arXiv:2501.01708•Advances in Mathematics of Communications•Jan 1, 2026•1 citation

Quantum error correction via codes over GF(2)

Arijit Chowdhury, Balaji Sundar Rajan

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 3n-length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•14 citations

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices

Cao, Meng

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these matrix-product codes.

arXiv:2012.15691•Dec 31, 2020•3 citations
Additive conjucyclic codes over Fq2\mathbb{F}_{q^2}Fq2​ 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 Fq\mathbb{F}_qFq​-linear isomorphism between Fq2n\mathbb{F}_{q^2}^nFq2n​ and Fq2n\mathbb{F}_q^{2n}Fq2n​. This correspondence shows that additive conjucyclic codes of length nnn correspond bijectively to qqq-ary linear cyclic codes of length 2n2n2n, 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 Fq2n\mathbb{F}_{q^2}^nFq2n​, which is shown to be compatible with the symplectic inner product on Fq2n\mathbb{F}_q^{2n}Fq2n​ 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 qqq-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 qqq-ary QECCs from additive conjucyclic codes, together with an illustrative example.
Abstract As a tool towards quantum error correction, additive conjucyclic codes have gained great attention. But, their algebraic structure is completely unknown over finite fields (except Fq2{\mathbb {F}}_{q^2}Fq2​ Fq2 ) as well as rings. In this article, we investigate the structure of additive conjucyclic codes over Galois rings GR(2r,2)GR(2^r,2)GR(2r,2) GR(2r,2) , where r≥2r\ge 2r≥2 r≥2 is an integer. We develop a one-to-one correspondence between the family of additive conjucyclic codes of lengthnover GR(2r,2)GR(2^r,2)GR(2r,2) GR(2r,2) and the family of linear cyclic codes of length 2nover Z2r{\mathbb {Z}}_{2^r}Z2r​ Z2r . This correspondence helps to obtain additive conjucyclic codes over GR(2r,2)GR(2^r,2)GR(2r,2) GR(2r,2) via known linear cyclic codes over Z2r{\mathbb {Z}}_{2^r}Z2r​ Z2r . We prove that the trace dual CTr{\mathscr {C}}^{Tr}CTr CTr of an additive conjucyclic code C{\mathscr {C}}C C is also an additive conjucyclic code. Moreover, we derive a necessary and sufficient condition of additive conjucyclic codes to be self-dual. We further propose a technique for constructing linear cyclic codes over Z2r{\mathbb {Z}}_{2^r}Z2r​ Z2r contained in additive conjucyclic codes over GR(2r,2)GR(2^r,2)GR(2r,2) GR(2r,2) . Last but not least, we explicitly derive the generator matrices for these codes.
Conjucyclic codes are part of a family of codes that includes cyclic, constacyclic, and quasi-cyclic codes, among others. Despite their importance in quantum error correction, they have not received much attention in the literature. This paper focuses on additive conjucyclic (ACC) codes over $ \mathbb{F}_4 $ and investigates their properties. Specifically, we derive the duals of ACC codes by using a trace inner product and obtain the trace hull and its dimension. Also, we establish a necessary and sufficient condition for an additive code to have a complementary dual (ACD). Additionally, we identify a necessary condition for an additive conjucyclic complementary pair of codes over $ \mathbb{F}_4 $. Furthermore, we show that the trace code of an ACC code is cyclic and provide a condition for the trace code of an ACC code to be LCD. To demonstrate the practical application of our findings, we construct some good entanglement-assisted quantum error-correcting (EAQEC) codes using the trace code of ACC codes.
A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,one method for constructing quantum constacyclic codes is presented by finding self-orthogonal classical constacyclic codes over the field GF(4) under a trace inner product.Finally,some examples are given.As an application of this method,quantum Hamming codes are constructed.This class of quantum codes includes well-known quantum cyclic codes.
In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.
It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 3n-length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these matrix-product codes.