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)

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

Mohammed Sabiri

Published Dec 3, 2025• 0 citations
Publisher

Abstract

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

DOI
10.1109/commnet68224.2025.11288868

Related papers

New non-binary quantum codes from constacyclic codes over $ \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $

Fanghui Ma, Jian Gao, Fang‐Wei Fu

Let $ R = \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $ be a finite non-chain ring, where $ q $ is an odd prime power and $ u^{2} = 1 $, $ v^2 = v $, $ uv = vu $. In this paper, we construct new non-binary quantum codes from ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $. We give the structure of ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $ and obtain self-orthogonal codes over $ \mathbb{F}_q $ by Gray map. By using Calderbank-Shor-Steane (CSS) construction and Hermitian construction from dual-containing ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $, some new non-binary quantum codes are obtained.

Advances in Mathematics of Communications•Jan 1, 2019•47 citations

Quantum and LCD codes from skew constacyclic codes over a general class of non-chain rings

Pradeep Rai, Bhupendra Singh, Ashok Ji Gupta

Abstract In this paper, we study skew constacyclic codes over a class of non-chain rings $\mathcal{T}=\mathbb{F}_q[u_1,u_2,\ldots, u_r]/ \langle f_i(u_i), u_iu_j-u_ju_i\rangle_{i,j=1}^r$, where $q=p^m$, $p$ is some odd prime, $m$ is a positive integer and $f_i(u_i)$ are non-constant polynomials which split into distinct linear factors. We discuss the structural properties of skew constacyclic codes over $\mathcal{T}$ and their dual. We characterize (Euclidean and Hermitian) dual-containing skew constacyclic codes. These characterizations serve as a foundational framework for the development of techniques to construct quantum codes. Consequently, we derive plenty of new quantum codes including many Maximum Distance Separable (MDS) quantum codes, and many quantum codes with better parameters than existing ones. Our work further extends to the characterization of skew constacyclic Euclidean and Hermitian Linear Complementary Dual (LCD) codes over $\mathcal{T}$, and we establish that their Gray images also preserve the LCD property. From this analysis, we derive numerous Maximum Distance Separable (MDS) codes and Best-Known Linear Codes (BKLC) over $\mathbb{F}_q$. MSC Classification: MSC 11T06, MSC 81P70, MSC94B05, MSC 94B15, MSC 94B99

Quantum Information Processing•Jul 18, 2024•7 citations

Quantum Codes from Galois Hulls of Constacyclic Codes over a Finite Non-Chain Ring

Enbin Zhang, Bo Hyun Kong, Xiying Zheng

We study the algebraic structures of constacyclic codes over a new finite non-chain ring R and their l-Galois dual codes based on a new Gray map ϕ and determine the dimensions of the l-Galois hull of constacyclic codes over R. Furthermore, we propose a quantum construction X of the Galois inner product to construct quantum codes by combining the Calderbank–Shor–Steane (CSS) construction, Hermitian construction and construction X. As an application, by calculating the dimensions of the l-Galois hull of constacyclic codes over R, we obtain some new quantum maximum distance separable (QMDS) codes and new quantum error-correcting codes (QECCs) that are better than the best known ones.

Entropy•Apr 3, 2026•1 citation

New non-binary quantum codes from skew constacyclic codes over the ring $\mathbb{F}_{p^m}+v\mathbb{F}_{p^m}+v^2 \mathbb{F}_{p^m}$

Ram Krishna Verma, Om Prakash, Ashutosh Singh

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to obtain such quantum codes, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring $\mathcal{R}$. Then a necessary and sufficient condition for skew constacyclic codes over $\mathcal{R}$ to contain their Euclidean duals is established. Finally, with the help of CSS construction and using Gray map, many new non-binary quantum codes are obtained over $\mathbb{F}_{p^m}$.

arXiv:2010.07175•Oct 14, 2020•0 citations

New quantum codes from skew constacyclic codes

Ram Krishna Verma, Om Prakash, Ashutosh Singh +1 more

For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.

Advances in Mathematics of Communications•Aug 19, 2021•21 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
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.
Let $ R = \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $ be a finite non-chain ring, where $ q $ is an odd prime power and $ u^{2} = 1 $, $ v^2 = v $, $ uv = vu .Inthispaper,weconstructnewnon−binaryquantumcodesfrom(. In this paper, we construct new non-binary quantum codes from (.Inthispaper,weconstructnewnon−binaryquantumcodesfrom( \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R .Wegivethestructureof(. We give the structure of (.Wegivethestructureof( \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $ and obtain self-orthogonal codes over $ \mathbb{F}_q $ by Gray map. By using Calderbank-Shor-Steane (CSS) construction and Hermitian construction from dual-containing ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $, some new non-binary quantum codes are obtained.
Abstract In this paper, we study skew constacyclic codes over a class of non-chain rings T=Fq[u1,u2,…,ur]/⟨fi(ui),uiuj−ujui⟩i,j=1r\mathcal{T}=\mathbb{F}_q[u_1,u_2,\ldots, u_r]/ \langle f_i(u_i), u_iu_j-u_ju_i\rangle_{i,j=1}^rT=Fq​[u1​,u2​,…,ur​]/⟨fi​(ui​),ui​uj​−uj​ui​⟩i,j=1r​, where q=pmq=p^mq=pm, ppp is some odd prime, mmm is a positive integer and fi(ui)f_i(u_i)fi​(ui​) are non-constant polynomials which split into distinct linear factors. We discuss the structural properties of skew constacyclic codes over T\mathcal{T}T and their dual. We characterize (Euclidean and Hermitian) dual-containing skew constacyclic codes. These characterizations serve as a foundational framework for the development of techniques to construct quantum codes. Consequently, we derive plenty of new quantum codes including many Maximum Distance Separable (MDS) quantum codes, and many quantum codes with better parameters than existing ones. Our work further extends to the characterization of skew constacyclic Euclidean and Hermitian Linear Complementary Dual (LCD) codes over T\mathcal{T}T, and we establish that their Gray images also preserve the LCD property. From this analysis, we derive numerous Maximum Distance Separable (MDS) codes and Best-Known Linear Codes (BKLC) over Fq\mathbb{F}_qFq​. MSC Classification: MSC 11T06, MSC 81P70, MSC94B05, MSC 94B15, MSC 94B99
We study the algebraic structures of constacyclic codes over a new finite non-chain ring R and their l-Galois dual codes based on a new Gray map ϕ and determine the dimensions of the l-Galois hull of constacyclic codes over R. Furthermore, we propose a quantum construction X of the Galois inner product to construct quantum codes by combining the Calderbank–Shor–Steane (CSS) construction, Hermitian construction and construction X. As an application, by calculating the dimensions of the l-Galois hull of constacyclic codes over R, we obtain some new quantum maximum distance separable (QMDS) codes and new quantum error-correcting codes (QECCs) that are better than the best known ones.
New non-binary quantum codes from skew constacyclic codes over the ring Fpm+vFpm+v2Fpm\mathbb{F}_{p^m}+v\mathbb{F}_{p^m}+v^2 \mathbb{F}_{p^m}Fpm​+vFpm​+v2Fpm​
In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring R=Fpm[v]/⟨v3=v⟩\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangleR=Fpm​[v]/⟨v3=v⟩ where ppp is an odd prime and m≥1m \geq 1m≥1. In order to obtain such quantum codes, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring R\mathcal{R}R. Then a necessary and sufficient condition for skew constacyclic codes over R\mathcal{R}R to contain their Euclidean duals is established. Finally, with the help of CSS construction and using Gray map, many new non-binary quantum codes are obtained over Fpm\mathbb{F}_{p^m}Fpm​.
For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
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 .