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

International Conference on Advanced Communication Technologies and Networking (CommNet)

On quantum and LCD Codes Over The Ring F q [u, v, w, z] /

Mohammed Sabiri, Bassou Aouijil

Published Dec 4, 2024• 0 citations
Publisher

Abstract

For an odd prime power q and ${\mathcal{R}}_{7}=\mathbb{F}_{q}+u \mathbb{F}_{q}+$ $v \mathbb{F}_{q}+w \mathbb{F}_{q}+z \mathbb{F}_{q}+u^{2} \mathbb{F}_{q}+w z \mathbb{F}_{q}$. Through this work we seek to construct new quantum codes and LCD codes by means of cyclic codes built on the ring ${\mathcal{R}}_{7}$. By using cyclic codes containing their duals, we give quantum codes, we also give a method for the construction of LCD Codes over ${\mathcal{R}}_{7}$.

DOI
10.1109/commnet63022.2024.10793302

Related papers

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

On the Structure of Cyclic Codes Over $\mathbb{F}_{q}{RS}$ and Applications in Quantum and LCD Codes Constructions

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

Let p be an odd prime, q = pm, R = Fq+ uFqwith u2= 1, and S = Fq+ uFq+ vFq+ uvFqwith u2= 1, v2= 1, uv = vu. In this paper, FqRS-cyclic codes over FqRS are studied. As an application, we present a construction of quantum error-correcting codes (QECCs) from the FqRS-cyclic codes over FqRS, which provides new QECCs. We also consider linear complementary dual (LCD) codes from the FqRS-cyclic codes over FqRS. Among others, we construct a Gray map over FqRS and discuss the Gray images of FqRS-cyclic codes over Fq.

IEEE Access•Jan 1, 2020•36 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•3 citations

Quantum and LCD Codes from the Consatacyclic Codes derived from the Ring R

Mohammed Sabiri, Bassou Aouijil

Let${\mathcal{R}} = {{\mathbb{F}}_q}[u,v]/,$ where ${{\mathbb{F}}_q}$ is a finite of cardinality q and u2= u,v3= v,uv = vu. In this work, we investigate quantum and LCD codes over ${{\mathbb{F}}_q}$ by using constacyclic codes over the ring ${\mathcal{R}}$, for the first codes, dual or not dual containing codes were used, and for the second codes, constacylic LCD codes were used in order to produce good codes over finite fields.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 3, 2025•0 citations

Some new Quantum Codes and LCD Codes over a finite non-chain ring

Mohammed Sabiri

Let $\mathcal{T} = {\mathbb{F}_{{p^s}}} + {u_1}{\mathbb{F}_{{p^s}}} + {u_2}{\mathbb{F}_{{p^s}}} + {u_3}{\mathbb{F}_{{p^s}}} + u_1^2{\mathbb{F}_{{p^s}}}$ be a finite non-chain ring. In this paper, we propose a method of constructing quantum codes and LCD codes from constacyclic codes over $\mathcal{T}$. The first codes are obtained via the Gray map and the Calderbank-Shor-Steane construction from Euclidean dualcontaining constacyclic codes over $\mathcal{T}$. The second codes are obtained as the gray image of consta cyclic codes of LCD codes over $\mathcal{T}$.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 3, 2025•0 citations

LCD Codes and Quantum Mysteries: Insights into Construction Techniques from Cyclic Codes over Finite Commutative Rings

Mamta Kansal, Anju Sharma, Vinod Kumar,

Let be a field of order q, whereas and are two not zero items of , and q is a fraction of an unusual prime p. This article's main objective is to investigate the structural characteristics of cyclic codes over the finite ring R = . In . The researcher constructs quantum-error-correcting (QEC) codes over R by decomposing the ring R into its parts, , utilising orthogonal idempotent . As an example, we create a few ideal LCD codes.

Journal of Propulsion Technology•Mar 30, 2024•0 citations
For an odd prime power q and R7=Fq+uFq+{\mathcal{R}}_{7}=\mathbb{F}_{q}+u \mathbb{F}_{q}+R7​=Fq​+uFq​+ vFq+wFq+zFq+u2Fq+wzFqv \mathbb{F}_{q}+w \mathbb{F}_{q}+z \mathbb{F}_{q}+u^{2} \mathbb{F}_{q}+w z \mathbb{F}_{q}vFq​+wFq​+zFq​+u2Fq​+wzFq​. Through this work we seek to construct new quantum codes and LCD codes by means of cyclic codes built on the ring R7{\mathcal{R}}_{7}R7​. By using cyclic codes containing their duals, we give quantum codes, we also give a method for the construction of LCD Codes over R7{\mathcal{R}}_{7}R7​.
On the Structure of Cyclic Codes Over FqRS\mathbb{F}_{q}{RS}Fq​RS and Applications in Quantum and LCD Codes Constructions
Let p be an odd prime, q = pm, R = Fq+ uFqwith u2= 1, and S = Fq+ uFq+ vFq+ uvFqwith u2= 1, v2= 1, uv = vu. In this paper, FqRS-cyclic codes over FqRS are studied. As an application, we present a construction of quantum error-correcting codes (QECCs) from the FqRS-cyclic codes over FqRS, which provides new QECCs. We also consider linear complementary dual (LCD) codes from the FqRS-cyclic codes over FqRS. Among others, we construct a Gray map over FqRS and discuss the Gray images of FqRS-cyclic codes over Fq.
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.
LetR=Fq[u,v]/,{\mathcal{R}} = {{\mathbb{F}}_q}[u,v]/,R=Fq​[u,v]/, where Fq{{\mathbb{F}}_q}Fq​ is a finite of cardinality q and u2= u,v3= v,uv = vu. In this work, we investigate quantum and LCD codes over Fq{{\mathbb{F}}_q}Fq​ by using constacyclic codes over the ring R{\mathcal{R}}R, for the first codes, dual or not dual containing codes were used, and for the second codes, constacylic LCD codes were used in order to produce good codes over finite fields.
Let T=Fps+u1Fps+u2Fps+u3Fps+u12Fps\mathcal{T} = {\mathbb{F}_{{p^s}}} + {u_1}{\mathbb{F}_{{p^s}}} + {u_2}{\mathbb{F}_{{p^s}}} + {u_3}{\mathbb{F}_{{p^s}}} + u_1^2{\mathbb{F}_{{p^s}}}T=Fps​+u1​Fps​+u2​Fps​+u3​Fps​+u12​Fps​ be a finite non-chain ring. In this paper, we propose a method of constructing quantum codes and LCD codes from constacyclic codes over T\mathcal{T}T. The first codes are obtained via the Gray map and the Calderbank-Shor-Steane construction from Euclidean dualcontaining constacyclic codes over T\mathcal{T}T. The second codes are obtained as the gray image of consta cyclic codes of LCD codes over T\mathcal{T}T.