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:2501.01708 · Advances in Mathematics of Communications

$ (\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

Published Jan 1, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.3934/amc.2026050

Related papers

Encoding and Construction of Quantum Codes from $(γ,Δ)$-cyclic Codes over a Class of Non-chain Rings

Om Prakash, Shikha Patel, Habibul Islam

Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(γ,Δ)$-cyclic codes over a class of finite non-chain commutative rings $\mathscr{R}_{q,s}=\mathbb{F}_q[v_1,v_2,\dots,v_s]/\langle v_i-v_i^2,v_iv_j=v_jv_i=0\rangle$ where $γ$ is an automorphism of $\mathscr{R}_{q,s}$, $Δ$ is a $γ$-derivation of $\mathscr{R}_{q,s}$ and $1\leq i\neq j\leq s$ for a positive integer $s$. Here, we show that a $(γ,Δ)$-cyclic code of length $n$ over $\mathscr{R}_{q,s}$ is the direct sum of $(θ,\Im)$-cyclic codes of length $n$ over $\mathbb{F}_q$, where $θ$ is an automorphism of $\mathbb{F}_q$ and $\Im$ is a $θ$-derivation of $\mathbb{F}_q$. Further, necessary and sufficient conditions for both $(γ,Δ)$-cyclic and $(θ,\Im)$-cyclic codes to contain their Euclidean duals are established. Then, we obtain many quantum codes by applying the dual containing criterion on the Gray images of these codes. These codes have better parameters than those available in the literature. Finally, the encoding and error-correction procedures for our proposed quantum codes are discussed.

arXiv:2404.01904•Apr 2, 2024•0 citations

New Non-Binary Quantum Codes from Cyclic Codes Over Product Rings

Tushar Bag, Hai Quang Dinh, Ashish Kumar Upadhyay +1 more

For any odd prime p, and a divisor ℓ of p, we consider Ie to be the set of all divisors of p - 1, which are less than or equal to ℓ. In this letter, we construct quantum codes from cyclic codes over Fpand FpSℓ, where Sℓ= Πi∈IℓRi, for Ri= (Fp[u])/(〈ui+1-u〉). For that, first we construct linear codes and a Gray map over Rℓ. Using this construction, we study cyclic codes over Rℓ, and then extend that over FpSℓ. We also give a Gray map over FpSℓ. Then, using necessary and sufficient condition of dual containing property for cyclic codes, we construct quantum MDS codes. It is observed that the quantum codes constructed are new in the literature.

IEEE Communications Letters•Dec 13, 2019•24 citations

New Quantum Codes and (θ, δ, β)-Cyclic Codes

Ashutosh Singh, Priyanka Sharma, Om Prakash

For a prime p and a positive integer e, let$\mathbb {F}_{p^{e}}$be the finite field of order$p^{e}$and$\mathfrak {R}_{\ell } $be a non-chain ring given by$\mathfrak {R}_{\ell } :=\mathbb {F}_{p^{e}}[v]/\langle v^{\ell } -1\rangle,~\ell \gt 1$. This study presents the$(\theta _{1},\delta _{1},\beta _{1})$-cyclic codes over$\mathfrak {R}_{\ell } $and$(\theta _{i},\delta _{i},\beta _{i})$-cyclic codes over$\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } $for$i=0,1$. Further, we study the application of these codes in the construction of quantum codes. Towards this, we define a Gray map to find images of the elements of$\mathfrak {R}_{\ell } $and$\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } $over the copies of$\mathbb {F}_{p^{e}}$, and then establish the dual-containing conditions for these codes. Finally, using the CSS construction and a propagation rule, we find many non-binary quantum and classical codes with better parameters.

IEEE Access•Jan 1, 2024•4 citations

m-adic residue codes over F_q[v]/(v^s-v) and their applications to quantum codes

Ferhat Kürüz, Mustafa Sarı, Mehmet E. Köroğlu

Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The $m$-adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the $m$-adic residue codes over the quotient ring $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$. We determine the idempotent generators of the $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$. We obtain some parameters of optimal $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ with respect to Griesmer bound for rings. Furthermore, we derive a condition for $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ to contain their dual. By making use of a preserving-orthogonality Gray map, we construct a family of quantum error correcting codes from the Gray images of dual-containing $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ and give some examples to illustrate our findings.

arXiv:1810.11826•Quantum Information and Computation•Apr 1, 2022•1 citation

New quantum codes from skew constacyclic codes

Ram Krishna Verma, Om Prakash, Ashutosh Singh +1 more

For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.

Advances in Mathematics of Communications•Aug 19, 2021•21 citations

New Non-binary Quantum Codes Over Fq+uFq+vFq+uvFq

Leilei Gao

Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.

International Journal of Discrete Mathematics•Jan 1, 2019•0 citations
In this article, for a finite field Fq\mathbb{F}_qFq​ and a natural number l,l,l, let R\mathcal{R}R denote the product ring Fql.\mathbb{F}_q^l.Fql​. Firstly, for an automorphism Θ\ThetaΘ of R,\mathcal{R},R, a Θ\ThetaΘ-derivation ΔΘ\Delta_\ThetaΔΘ​ of R\mathcal{R}R and for a unit a\mathit{\boldsymbol{a}}a in R,\mathcal{R},R, we study (Θ,ΔΘ,a)(\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}})(Θ,ΔΘ​,a)-cyclic codes over R.\mathcal{R}.R. In this direction, we give an algebraic characterization of a (Θ,ΔΘ,a)(\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}})(Θ,ΔΘ​,a)-cyclic code over R\mathcal{R}R, determine its generator polynomial, and find its decomposition over Fq.\mathbb{F}_q.Fq​. Secondly, we give a necessary and sufficient condition for a (Θ,0,a)(\Theta, 0, \mathit{\boldsymbol{a}})(Θ,0,a)-cyclic code to be Euclidean dual-containing code over R.\mathcal{R}.R. Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over Fq\mathbb{F}_qFq​ as Gray images of (Θ,ΔΘ,a)(\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}})(Θ,ΔΘ​,a)-cyclic codes over R.\mathcal{R}.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.
Encoding and Construction of Quantum Codes from (γ,Δ)(γ,Δ)(γ,Δ)-cyclic Codes over a Class of Non-chain Rings
Let Fq\mathbb{F}_qFq​ be a finite field of q=pmq=p^mq=pm elements where ppp is a prime and mmm is a positive integer. This paper considers (γ,Δ)(γ,Δ)(γ,Δ)-cyclic codes over a class of finite non-chain commutative rings Rq,s=Fq[v1,v2,…,vs]/⟨vi−vi2,vivj=vjvi=0⟩\mathscr{R}_{q,s}=\mathbb{F}_q[v_1,v_2,\dots,v_s]/\langle v_i-v_i^2,v_iv_j=v_jv_i=0\rangleRq,s​=Fq​[v1​,v2​,…,vs​]/⟨vi​−vi2​,vi​vj​=vj​vi​=0⟩ where γγγ is an automorphism of Rq,s\mathscr{R}_{q,s}Rq,s​, ΔΔΔ is a γγγ-derivation of Rq,s\mathscr{R}_{q,s}Rq,s​ and 1≤i≠j≤s1\leq i\neq j\leq s1≤i=j≤s for a positive integer sss. Here, we show that a (γ,Δ)(γ,Δ)(γ,Δ)-cyclic code of length nnn over Rq,s\mathscr{R}_{q,s}Rq,s​ is the direct sum of (θ,ℑ)(θ,\Im)(θ,ℑ)-cyclic codes of length nnn over Fq\mathbb{F}_qFq​, where θθθ is an automorphism of Fq\mathbb{F}_qFq​ and ℑ\Imℑ is a θθθ-derivation of Fq\mathbb{F}_qFq​. Further, necessary and sufficient conditions for both (γ,Δ)(γ,Δ)(γ,Δ)-cyclic and (θ,ℑ)(θ,\Im)(θ,ℑ)-cyclic codes to contain their Euclidean duals are established. Then, we obtain many quantum codes by applying the dual containing criterion on the Gray images of these codes. These codes have better parameters than those available in the literature. Finally, the encoding and error-correction procedures for our proposed quantum codes are discussed.
For any odd prime p, and a divisor ℓ of p, we consider Ie to be the set of all divisors of p - 1, which are less than or equal to ℓ. In this letter, we construct quantum codes from cyclic codes over Fpand FpSℓ, where Sℓ= Πi∈IℓRi, for Ri= (Fp[u])/(〈ui+1-u〉). For that, first we construct linear codes and a Gray map over Rℓ. Using this construction, we study cyclic codes over Rℓ, and then extend that over FpSℓ. We also give a Gray map over FpSℓ. Then, using necessary and sufficient condition of dual containing property for cyclic codes, we construct quantum MDS codes. It is observed that the quantum codes constructed are new in the literature.
For a prime p and a positive integer e, letFpe\mathbb {F}_{p^{e}}Fpe​be the finite field of orderpep^{e}peand$\mathfrak {R}_{\ell } beanon−chainringgivenbybe a non-chain ring given bybeanon−chainringgivenby\mathfrak {R}_{\ell } :=\mathbb {F}_{p^{e}}[v]/\langle v^{\ell } -1\rangle,~\ell \gt 1.Thisstudypresentsthe. This study presents the.Thisstudypresentsthe(\theta _{1},\delta _{1},\beta _{1})−cycliccodesover-cyclic codes over−cycliccodesover\mathfrak {R}_{\ell } andandand(\theta _{i},\delta _{i},\beta _{i})−cycliccodesover-cyclic codes over−cycliccodesover\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } forforfori=0,1.Further,westudytheapplicationofthesecodesintheconstructionofquantumcodes.Towardsthis,wedefineaGraymaptofindimagesoftheelementsof. Further, we study the application of these codes in the construction of quantum codes. Towards this, we define a Gray map to find images of the elements of.Further,westudytheapplicationofthesecodesintheconstructionofquantumcodes.Towardsthis,wedefineaGraymaptofindimagesoftheelementsof\mathfrak {R}_{\ell } andandand\mathbb {F}_{p^{e}}\mathfrak {R}_{\ell } overthecopiesofover the copies ofoverthecopiesof\mathbb {F}_{p^{e}}$, and then establish the dual-containing conditions for these codes. Finally, using the CSS construction and a propagation rule, we find many non-binary quantum and classical codes with better parameters.
Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The mmm-adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the mmm-adic residue codes over the quotient ring Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​. We determine the idempotent generators of the mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​. We obtain some parameters of optimal mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ with respect to Griesmer bound for rings. Furthermore, we derive a condition for mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ to contain their dual. By making use of a preserving-orthogonality Gray map, we construct a family of quantum error correcting codes from the Gray images of dual-containing mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ and give some examples to illustrate our findings.
For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.