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

Journal of Integrated Science and Technology

Construction of Quantum codes from Constacyclic codes over Fl [ μ,ν,w]/<μ2-1, ν2-ν, w2-1, μν-νμ, νw-wν, μw-wμ>

Rekha Kumawat, Monika Sangwan

Published May 12, 2026• 0 citations
Publisher

Abstract

In this paper, we analyze the structural properties and construction technique of quantum codes(QC) over F_l. The focus is on constructing QC using constacyclic codes defined over the finite commutative non-chain ring H_s= F_l+μF_l+νF_l+〖wF〗_l+μνF_l+νwF_l+μwF_l+μν〖wF〗_l, where the indeterminates satisfy μ^2=1, ν^2=ν, w^2=1,μν=νμ,νw=wν,and μw=wμ. A complete set of idempotent generators of the ring H_s is determined, and linear codes are constructed using self-inverse units. A Gray map from H_s to F_l^8is defined to preserve algebraic duality, thereby facilitating the application of the CSS construction method for deriving QC. Constacyclic codes over H_s are decomposed into cyclic and negacyclic codes over F_l. This decomposition enables the explicit computation of the parameters of the resulting QC. Several families of QC of arbitrary length are obtained as illustrative examples. The novelty of this study lies in the exclusive use of self-inverse units in the construction process and in the decomposition behavior of constacyclic codes over H_s for QC construction.

DOI
10.62110/sciencein.jist.2026.v14.1591

Related papers

Quantum codes derived from constacyclic codes over Z3 [u,v]/

Rekha, Monika Sangwan

The structural properties and construction methodologies of quantum codes (QCs) defined over the finite field Z_3, the finite field with three elements, are examined in this work. The primary focus is on utilizing constacyclic codes within a specific algebraic structure the finite commutative non-chain ring R=Z3+uZ3+vZ3+uvZ3, where the indeterminates u and v satisfy the relations u2=1, v2=1, and uv=vu. We provide a set of idempotent generators of the ring and define linear codes and calculated some self-inverse units. The relationship between R and Z34 is established using a gray map. Constacyclic (CC) codes are broken down into cyclic (C) codes and negacyclic (N) codes in order to determine the parameters of QCs over Z_3. Several QCs of arbitrary lengths are developed as an application. In this paper, we calculated those various parameters of QCs which are better than existing parameters of QCs. This paper contains only those units which have self-inverse.

International Journal of Statistics and Applied Mathematics•Aug 1, 2025•0 citations

Quantum codes obtained through (1+(p−2)ν)-constacyclic codes over Zp+νZp

This paper is concerned with, structural properties and construction of quantum codes over Z p by using (1+(p−2)ν)-Constacyclic codes over the finite commutative non-chain ring ℜ = Z p +νZ p where ν 2 = ν and Z p is field having p elements with characteristic p where p is prime. A Gray map is defined between ℜ and Z p 2 . The parameters of quantum codes over Z p are obtained by decomposing (1+(p−2)ν)-constacyclic codes into cyclic and negacyclic codes over Z p . As an application, some examples of quantum codes of arbitrary length, are also obtained.

Journal of Mathematical and Computational Science•Jan 1, 2021•1 citation

Quantum Codes Obtained through Constacyclic Codes over Z3 + νZ3 + ωZ3 + νωZ3

Jagbir Singh, Prateek Mor, Shikha . +1 more

This paper is concerned with, structural properties and construction of quantum codes over Z3 by using constacyclic codes over the finite commutative non-chain ring R = Z3 + νZ3 + ωZ3 + νωZ3 where ν2 = 1, ω2 = ω, νω = νω, and Z3 is field having 3 elements with characteristic 3. A Gray map is defined between R and Z43. The parameters of quantum codes over Z3 are obtained by decomposing constacyclic codes into cyclic and negacyclic codes over Z3. As an application, some examples of quantum codes of arbitrary length, are also obtained.

European Journal of Pure and Applied Mathematics•Aug 5, 2021•2 citations

QUANTUM CODES OBTAINED THROUGH -CONSTACYCLIC CODES OVER

Pinki, Sangita Yadav, Balveer Singh +1 more

The structural properties and construction of quantum codes over  using Constacyclic codes over the finite commutative non-chain ring  = where  are the focus of htis paperand  is field having  elements with characteristic p where p is an prime such that . A Gray map is defined between  and . Decomposing constacyclic codes into cyclic and negacyclic codes over  yields the parameters of quantum codes over . Some examples of quantum codes of arbitrary length are also obtained as an application.

Advances and Applications in Discrete Mathematics•Feb 9, 2023•1 citation

Constacyclic Codes over Group Ring (Zq[v])/G

Alireza Soleimani

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum information. The construction of quantum codes via classical codes over 2 F was first introduced by Calderbank and Shor [4] and Steane [13] in 1996. This method, known as CSS construction, has received a lot of attention and it has allowed to find many good quantum stabilizer codes. Later, construction of quantum codes over larger alphabets from classical linear codes over q F has shown by Ketkar et al. in [10]. One direction of the main research in quantum error correction codes is constructing quantum codes that have large minimum distances [9] for a given size and length. In [14], based on classical quaternary constacyclic linear codes, some parameters for quantum codes are obtained. In [8, 9], respectively based on classical negacyclic and constacyclic linear codes some parameters for quantum MDS codes are presented. In this work, we determine self-dual and self-orthogonal codes arising from constacyclic codes over the group ring(Zq[v]/G

Theory of Approximation and Applications•Mar 1, 2019•0 citations

QUANTUM CODES THROUGH CONSTACYCLIC CODES OVER Fp + μFp + νFp + ϖFp + μνFp + νϖFp + μϖFp + μνϖFp

Rekha Kumawat, Monika Sangwan

The purpose of this paper is to identify the structural characteristics and construction of quantum codes over $\mathcal{F}_p$ using $\alpha_1+\alpha_2 {\mu}+\alpha_3 {\nu}+\alpha_4 {\varpi}+\alpha_5 {\mu}{\nu}+\alpha_6 {\nu}{\varpi}+\alpha_7 {\mu}{\varpi}+\alpha_8 {\mu}{\nu}{\varpi}- $constacyclic codes over ring $\mathcal{R} ~= ~\mathcal{F}_p[{\mu},{\nu},{\varpi}]/<{\mu}^2-{\mu}, {\nu}^2-{\nu}, {\varpi}^2-{\varpi}~, {\mu}{\nu}-{\nu}{\mu}, {\nu}{\varpi}-{\varpi}{\nu}, {\mu}{\varpi}-{\varpi}{\mu}>$, here $\mathcal F_{p}$ is a finite field with p elements. We define a Gray map from $\mathcal{R}$ to $\mathcal{F}_p^{8}$, a distance-preserving map. Breaking down constacyclic codes into cyclic and negacyclic codes results in the creation of quantum codes over the finite field $\mathcal{F}_p$. As an application, some examples are illustrated to obtain the quantum codes of different parameters.

South East Asian J of Mathematics and Mathematical Sciences•Dec 30, 2025•0 citations
In this paper, we analyze the structural properties and construction technique of quantum codes(QC) over F_l. The focus is on constructing QC using constacyclic codes defined over the finite commutative non-chain ring H_s= F_l+μF_l+νF_l+〖wF〗_l+μνF_l+νwF_l+μwF_l+μν〖wF〗_l, where the indeterminates satisfy μ^2=1, ν^2=ν, w^2=1,μν=νμ,νw=wν,and μw=wμ. A complete set of idempotent generators of the ring H_s is determined, and linear codes are constructed using self-inverse units. A Gray map from H_s to F_l^8is defined to preserve algebraic duality, thereby facilitating the application of the CSS construction method for deriving QC. Constacyclic codes over H_s are decomposed into cyclic and negacyclic codes over F_l. This decomposition enables the explicit computation of the parameters of the resulting QC. Several families of QC of arbitrary length are obtained as illustrative examples. The novelty of this study lies in the exclusive use of self-inverse units in the construction process and in the decomposition behavior of constacyclic codes over H_s for QC construction.
The structural properties and construction methodologies of quantum codes (QCs) defined over the finite field Z_3, the finite field with three elements, are examined in this work. The primary focus is on utilizing constacyclic codes within a specific algebraic structure the finite commutative non-chain ring R=Z3+uZ3+vZ3+uvZ3, where the indeterminates u and v satisfy the relations u2=1, v2=1, and uv=vu. We provide a set of idempotent generators of the ring and define linear codes and calculated some self-inverse units. The relationship between R and Z34 is established using a gray map. Constacyclic (CC) codes are broken down into cyclic (C) codes and negacyclic (N) codes in order to determine the parameters of QCs over Z_3. Several QCs of arbitrary lengths are developed as an application. In this paper, we calculated those various parameters of QCs which are better than existing parameters of QCs. This paper contains only those units which have self-inverse.
This paper is concerned with, structural properties and construction of quantum codes over Z p by using (1+(p−2)ν)-Constacyclic codes over the finite commutative non-chain ring ℜ = Z p +νZ p where ν 2 = ν and Z p is field having p elements with characteristic p where p is prime. A Gray map is defined between ℜ and Z p 2 . The parameters of quantum codes over Z p are obtained by decomposing (1+(p−2)ν)-constacyclic codes into cyclic and negacyclic codes over Z p . As an application, some examples of quantum codes of arbitrary length, are also obtained.
This paper is concerned with, structural properties and construction of quantum codes over Z3 by using constacyclic codes over the finite commutative non-chain ring R = Z3 + νZ3 + ωZ3 + νωZ3 where ν2 = 1, ω2 = ω, νω = νω, and Z3 is field having 3 elements with characteristic 3. A Gray map is defined between R and Z43. The parameters of quantum codes over Z3 are obtained by decomposing constacyclic codes into cyclic and negacyclic codes over Z3. As an application, some examples of quantum codes of arbitrary length, are also obtained.
The structural properties and construction of quantum codes over  using Constacyclic codes over the finite commutative non-chain ring  = where  are the focus of htis paperand  is field having  elements with characteristic p where p is an prime such that . A Gray map is defined between  and . Decomposing constacyclic codes into cyclic and negacyclic codes over  yields the parameters of quantum codes over . Some examples of quantum codes of arbitrary length are also obtained as an application.
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum information. The construction of quantum codes via classical codes over 2 F was first introduced by Calderbank and Shor [4] and Steane [13] in 1996. This method, known as CSS construction, has received a lot of attention and it has allowed to find many good quantum stabilizer codes. Later, construction of quantum codes over larger alphabets from classical linear codes over q F has shown by Ketkar et al. in [10]. One direction of the main research in quantum error correction codes is constructing quantum codes that have large minimum distances [9] for a given size and length. In [14], based on classical quaternary constacyclic linear codes, some parameters for quantum codes are obtained. In [8, 9], respectively based on classical negacyclic and constacyclic linear codes some parameters for quantum MDS codes are presented. In this work, we determine self-dual and self-orthogonal codes arising from constacyclic codes over the group ring(Zq[v]/G
The purpose of this paper is to identify the structural characteristics and construction of quantum codes over Fp\mathcal{F}_pFp​ using $\alpha_1+\alpha_2 {\mu}+\alpha_3 {\nu}+\alpha_4 {\varpi}+\alpha_5 {\mu}{\nu}+\alpha_6 {\nu}{\varpi}+\alpha_7 {\mu}{\varpi}+\alpha_8 {\mu}{\nu}{\varpi}- $constacyclic codes over ring R = Fp[μ,ν,ϖ]/<μ2−μ,ν2−ν,ϖ2−ϖ ,μν−νμ,νϖ−ϖν,μϖ−ϖμ>\mathcal{R} ~= ~\mathcal{F}_p[{\mu},{\nu},{\varpi}]/<{\mu}^2-{\mu}, {\nu}^2-{\nu}, {\varpi}^2-{\varpi}~, {\mu}{\nu}-{\nu}{\mu}, {\nu}{\varpi}-{\varpi}{\nu}, {\mu}{\varpi}-{\varpi}{\mu}>R = Fp​[μ,ν,ϖ]/<μ2−μ,ν2−ν,ϖ2−ϖ ,μν−νμ,νϖ−ϖν,μϖ−ϖμ>, here Fp\mathcal F_{p}Fp​ is a finite field with p elements. We define a Gray map from R\mathcal{R}R to Fp8\mathcal{F}_p^{8}Fp8​, a distance-preserving map. Breaking down constacyclic codes into cyclic and negacyclic codes results in the creation of quantum codes over the finite field Fp\mathcal{F}_pFp​. As an application, some examples are illustrated to obtain the quantum codes of different parameters.