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

Mathematics

Construction of Quantum Codes over the Class of Commutative Rings and Their Applications to DNA Codes

Shakir Ali, Amal S. Alali, Elif Segah Öztaş, Pushpendra Sharma

Published Mar 15, 2023• 5 citations
Publisher

Abstract

Let k,m be positive integers and F2m be a finite field of order 2m of characteristic 2. The primary goal of this paper is to study the structural properties of cyclic codes over the ring Sk=F2m[v1,v2,…,vk]⟨vi2−αivi,vivj−vjvi⟩, for i,j=1,2,3,…,k, where αi is the non-zero element of F2m. As an application, we obtain better quantum error correcting codes over the ring S1 (for k=1). Moreover, we acquire optimal linear codes with the help of the Gray image of cyclic codes. Finally, we present methods for reversible DNA codes.

DOI
10.3390/math11061430

Related papers

On Optimal and Quantum Code Construction from Cyclic Codes over FqPQ with Applications

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

The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.

Entropy•Aug 2, 2023•4 citations

On the Construction of Quantum and LCD Codes from Cyclic Codes over the Finite Commutative Rings

Shakir Ali, Amal S. Alali, Mohammad Jeelani +3 more

Let Fq be a field of order q, where q is a power of an odd prime p, and α and β are two non-zero elements of Fq. The primary goal of this article is to study the structural properties of cyclic codes over a finite ring R=Fq[u1,u2]/⟨u12−α2,u22−β2,u1u2−u2u1⟩. We decompose the ring R by using orthogonal idempotents Δ1,Δ2,Δ3, and Δ4 as R=Δ1R⊕Δ2R⊕Δ3R⊕Δ4R, and to construct quantum-error-correcting (QEC) codes over R. As an application, we construct some optimal LCD codes.

Axioms•Apr 10, 2023•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

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

On Quantum Codes over Non Local Rings

Noureddine Essaidi, Abdelhamid Tadmori, Ossama El Abouti

We study the structural properties of the ring R = F p + uF p + u 2 F p + u 3 F p , where p = 2 is a prime and u 4 = u 3 , as well as the linear codes over R. We investigate the generator's cyclic codes and their dual codes over R.An isometric Gray map from R to F 4 p is defined.We offer an equivalence condition that cyclic codes must satisfy over R in order to include their dual.Moreover, we establish the existence of quantum error-correcting codes based on cyclic codes over R. Finally, under various criteria such as cyclic codes length and generator polynomial degree, we build quantum error-correcting codes over R which their dimensions are divided by p and 2 4 .

WSEAS TRANSACTIONS ON MATHEMATICS•Jan 2, 2024•0 citations

Quantum codes from cyclic codes over a class of nonchain rings

Mustafa Sarı, İrfan Şiap

Lately, quantum error correcting codes have been considered as the Gray images of some special codes over various rings. In this study, we investigate the structure of the cyclic codes of arbitrary length over the finite nonchain ring Rp= Fp+vFp+···+vp-1Fpwhere vp= v and obtain quantum error correcting codes over Fpby using the Gray map defined in the work of Bayram and Siap (2014).

International Conference on Modeling, Simulation, and Applied Optimization•May 1, 2015•3 citations
Let k,m be positive integers and F2m be a finite field of order 2m of characteristic 2. The primary goal of this paper is to study the structural properties of cyclic codes over the ring Sk=F2m[v1,v2,…,vk]⟨vi2−αivi,vivj−vjvi⟩, for i,j=1,2,3,…,k, where αi is the non-zero element of F2m. As an application, we obtain better quantum error correcting codes over the ring S1 (for k=1). Moreover, we acquire optimal linear codes with the help of the Gray image of cyclic codes. Finally, we present methods for reversible DNA codes.
The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.
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.
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.
We study the structural properties of the ring R = F p + uF p + u 2 F p + u 3 F p , where p = 2 is a prime and u 4 = u 3 , as well as the linear codes over R. We investigate the generator's cyclic codes and their dual codes over R.An isometric Gray map from R to F 4 p is defined.We offer an equivalence condition that cyclic codes must satisfy over R in order to include their dual.Moreover, we establish the existence of quantum error-correcting codes based on cyclic codes over R. Finally, under various criteria such as cyclic codes length and generator polynomial degree, we build quantum error-correcting codes over R which their dimensions are divided by p and 2 4 .