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 Propulsion Technology

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

Mamta Kansal, Anju Sharma, Vinod Kumar,

Published Mar 30, 2024• 0 citations
OpenAlex

Abstract

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.

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

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

New Quantum and LCD Codes over Finite Fields of Even Characteristic

Habibul Islam, Om Prakash

For an integer m ≥ 1, we study cyclic codes of length l over a commutative non-chain ring F2m + uF2m , where u2 = u . With a new Gray map and Euclidean dual-containing cyclic codes, we provide many new and superior codes to the best-known quantum error-correcting codes. Also, we characterise LCD codes of length l with respect to their generator polynomials and prove that F2m − image of an LCD code of length l is an LCD code of length 2l . Finally, we provide several optimal LCD codes from the Gray images of LCD codes over F2m + uF2m .

Defence Science Journal•Sep 2, 2021•16 citations

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

Mohammed Sabiri, Bassou Aouijil

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}$.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 4, 2024•0 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•37 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
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.
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.
For an integer m ≥ 1, we study cyclic codes of length l over a commutative non-chain ring F2m + uF2m , where u2 = u . With a new Gray map and Euclidean dual-containing cyclic codes, we provide many new and superior codes to the best-known quantum error-correcting codes. Also, we characterise LCD codes of length l with respect to their generator polynomials and prove that F2m − image of an LCD code of length l is an LCD code of length 2l . Finally, we provide several optimal LCD codes from the Gray images of LCD codes over F2m + uF2m .
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.
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.