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

IEEE Access

Quantum Codes Obtained From Constacyclic Codes Over a Family of Finite Rings Fp[u₁, u₂, …, us]

Hai Quang Dinh, Tushar Bag, Sachin Pathak, Ashish Kumar Upadhyay, Warattaya Chinnakum

Published Jan 1, 2020• 12 citations
Publisher

Abstract

In this article, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over Rs= Fp+ u1Fp+ ··· + usFp, ui2= ui, uiuj= ujui= 0, for odd prime p and i, j = 1, 2,⋯, s, i ≠ j. Many QECCs with improved parameters than the existing ones in some of the earlier papers are provided. We present a set of idempotent generators of the ring Rs, and using that we define linear codes, determine all units, and study constacyclic codes over this ring. Among others, we study dual containing constacyclic codes over Rs and construct (non-binary) QECCs. An algorithm to construct QECCs from dual containing constacyclic codes over Rs is obtained that can provide many quantum codes.

DOI
10.1109/access.2020.3033326

Related papers

Quantum Codes from Constacyclic Codes over the Ring Fq[u1,u2]/〈 u 1 2 -u1, u 2 2 -u2,u1u2-u2u1〉

Ahmad N. Al‐Kenani, Mohammad Ashraf, Ghulam Mohammad

In this paper, we study the structural properties of ( α + u 1 β + u 2 γ + u 1 u 2 δ ) -constacyclic codes over R = F q [ u 1 , u 2 ] / ⟨ u 1 2 − u 1 , u 2 2 − u 2 , u 1 u 2 − u 2 u 1 ⟩ where q = p m for odd prime p and m ≥ 1 . We derive the generators of constacyclic and dual constacyclic codes. We have shown that Gray image of a constacyclic code of length n is a quasi constacyclic code of length 4 n . Also we have classified all possible self dual linear codes over this ring R . We have given the applications by computing non-binary quantum codes over this ring R .

Mathematics•May 13, 2020•7 citations

Construction of Quantum Codes from Constacyclic Codes Over the Class of Commutative Rings

Pushpendra Sharma, Amal S. Alali, Shakir Ali +1 more

This paper primarily investigates the structural properties of constacyclic codes over the ring , defined as where i, j = 1, 2, 3, ..., k, and k, m are positive integers. Here, denotes a finite field of order pm with characteristic p, an odd prime. Furthermore, we determine the necessary and sufficient conditions for the duals of constacyclic codes to exist. These findings make it easier to create new Quantum Error-Correcting (QEC) codes throughout the ring (i.e., when k = 1), as well as optimal linear codes that make use of the Gray images of constacyclic codes. Additionally, Table 4 presents several Linear Complementary Dual (LCD) codes obtained using the Gray map.

Contemporary Mathematics•Aug 19, 2025•0 citations

ϒ – Constacyclic codes over a Frobenius ring and their application to find novel quantum codes

Pooja Soni, Manju Pruthi, Arun Kumar Yadav

In this work, we use the Hermitian technique to find novel Quantum error correcting codes (𝒬E𝒞𝒞’s) by Constacyclic codes (CCc’s) over the ring ℛ = ℱp2 [𝓊, 𝓋]/(𝓊3 – ω2 𝓊, 𝓋3 – ω2 𝓋), where p is a non-even prime power and ℱ*p 2 = 〈ω〉. Firstly, we express the ring in terms of “pairwise orthogonal Idempotent” elements & analyze “linear codes.” We investigate ring structure and establish a one-one, onto and distance preserving Gray map, ∅ ∶ ℛ𝓃→ℱ5𝓃 p2. We provide the units of ℛ, to analyze CCc’s & their generators. We also give a condition for this code to contain its Hermitian dual over ℛ. At last, we derive and tabulate some novel and efficient 𝒬E𝒞𝒞’s.

Journal of Discrete Mathematical Sciences and Cryptography•Jan 1, 2026•0 citations

Quantum codes from skew constacyclic codes over Fp m + vFp m + v2Fp m

Ram Krishna Verma, Om Prakash, Ashutosh Singh

For an odd prime p and m ≥ 1, let R = Fpm[v]/{v3} = v}. Here our aim is to construct new non-binary quantum codes from skew constacyclic codes over this non-chain ring ℛ. In order to achieve our goal, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring ℛ. Then we determine a necessary and sufficient condition for these codes to contain their Euclidean duals. Finally, by applying CSS construction on these dual containing skew constacyclic codes and using Gray map, we obtain several new quantum codes.

International Workshop Algebraic and Combinatorial Coding Theory•Oct 11, 2020•4 citations

Quantum codes from a class of constacyclic codes over finite commutative rings

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

Let [Formula: see text] be an odd prime, and [Formula: see text] be an integer such that [Formula: see text]. Using pairwise orthogonal idempotents [Formula: see text] of the ring [Formula: see text], with [Formula: see text], [Formula: see text] is decomposed as [Formula: see text], which contains the ring [Formula: see text] as a subring. It is shown that, for [Formula: see text], [Formula: see text], and it is invertible if and only if [Formula: see text] and [Formula: see text] are units of [Formula: see text]. In such cases, we study [Formula: see text]-constacyclic codes over [Formula: see text]. We present a direct sum decomposition of [Formula: see text]-constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a [Formula: see text]-constacyclic code to contain its dual are obtained. As an application, many new quantum codes over [Formula: see text], with better parameters than existing ones, are constructed from cyclic and negacyclic codes over [Formula: see text].

Journal of Algebra and Its Applications•Oct 31, 2019•25 citations

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
In this article, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over Rs= Fp+ u1Fp+ ··· + usFp, ui2= ui, uiuj= ujui= 0, for odd prime p and i, j = 1, 2,⋯, s, i ≠ j. Many QECCs with improved parameters than the existing ones in some of the earlier papers are provided. We present a set of idempotent generators of the ring Rs, and using that we define linear codes, determine all units, and study constacyclic codes over this ring. Among others, we study dual containing constacyclic codes over Rs and construct (non-binary) QECCs. An algorithm to construct QECCs from dual containing constacyclic codes over Rs is obtained that can provide many quantum codes.
In this paper, we study the structural properties of ( α + u 1 β + u 2 γ + u 1 u 2 δ ) -constacyclic codes over R = F q [ u 1 , u 2 ] / ⟨ u 1 2 − u 1 , u 2 2 − u 2 , u 1 u 2 − u 2 u 1 ⟩ where q = p m for odd prime p and m ≥ 1 . We derive the generators of constacyclic and dual constacyclic codes. We have shown that Gray image of a constacyclic code of length n is a quasi constacyclic code of length 4 n . Also we have classified all possible self dual linear codes over this ring R . We have given the applications by computing non-binary quantum codes over this ring R .
This paper primarily investigates the structural properties of constacyclic codes over the ring , defined as where i, j = 1, 2, 3, ..., k, and k, m are positive integers. Here, denotes a finite field of order pm with characteristic p, an odd prime. Furthermore, we determine the necessary and sufficient conditions for the duals of constacyclic codes to exist. These findings make it easier to create new Quantum Error-Correcting (QEC) codes throughout the ring (i.e., when k = 1), as well as optimal linear codes that make use of the Gray images of constacyclic codes. Additionally, Table 4 presents several Linear Complementary Dual (LCD) codes obtained using the Gray map.
In this work, we use the Hermitian technique to find novel Quantum error correcting codes (𝒬E𝒞𝒞’s) by Constacyclic codes (CCc’s) over the ring ℛ = ℱp2 [𝓊, 𝓋]/(𝓊3 – ω2 𝓊, 𝓋3 – ω2 𝓋), where p is a non-even prime power and ℱ*p 2 = 〈ω〉. Firstly, we express the ring in terms of “pairwise orthogonal Idempotent” elements & analyze “linear codes.” We investigate ring structure and establish a one-one, onto and distance preserving Gray map, ∅ ∶ ℛ𝓃→ℱ5𝓃 p2. We provide the units of ℛ, to analyze CCc’s & their generators. We also give a condition for this code to contain its Hermitian dual over ℛ. At last, we derive and tabulate some novel and efficient 𝒬E𝒞𝒞’s.
For an odd prime p and m ≥ 1, let R = Fpm[v]/{v3} = v}. Here our aim is to construct new non-binary quantum codes from skew constacyclic codes over this non-chain ring ℛ. In order to achieve our goal, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring ℛ. Then we determine a necessary and sufficient condition for these codes to contain their Euclidean duals. Finally, by applying CSS construction on these dual containing skew constacyclic codes and using Gray map, we obtain several new quantum codes.
Let [Formula: see text] be an odd prime, and [Formula: see text] be an integer such that [Formula: see text]. Using pairwise orthogonal idempotents [Formula: see text] of the ring [Formula: see text], with [Formula: see text], [Formula: see text] is decomposed as [Formula: see text], which contains the ring [Formula: see text] as a subring. It is shown that, for [Formula: see text], [Formula: see text], and it is invertible if and only if [Formula: see text] and [Formula: see text] are units of [Formula: see text]. In such cases, we study [Formula: see text]-constacyclic codes over [Formula: see text]. We present a direct sum decomposition of [Formula: see text]-constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a [Formula: see text]-constacyclic code to contain its dual are obtained. As an application, many new quantum codes over [Formula: see text], with better parameters than existing ones, are constructed from cyclic and negacyclic codes over [Formula: see text].
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.