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

arXiv:2606.22069

Hulls and sums of separable constacyclic codes over $\mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)$ and new quantum codes

Yu Qian, Yu Wang, Liqi Wang

Published Jun 20, 2026• 0 citations
arXivHTMLPDF

Abstract

We establish the generator polynomials of the Euclidean and Hermitian duals of separable constacyclic codes over $\mathcal{S} = \mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)$, with $q$ an odd prime power and $v^2=v$, and we derive the generator polynomials of their Gray images, respectively. The generator polynomials of the Euclidean hulls and Hermitian hulls of separable constacyclic codes over $\mathcal{S}$ and their Gray images are presented, respectively. Furthermore, we provide the generator polynomials of the Euclidean sums and Hermitian sums of separable constacyclic codes and their Gray images, respectively. Finally, we propose two methods to yield quantum error-correcting codes (QECCs) from the hulls and sums of separable constacyclic codes over $\mathcal{S}$, and generate new QECCs that outperform the existing ones in terms of parameters.

DOI
10.48550/arxiv.2606.22069

Related papers

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•6 citations

Hulls of Non-Separable Constacyclic Codes over FqR and Their Applications in Constructing New QECCs

Xiying Zheng, Bo Hyun Kong, Enbin Zhang

Let R=Fq[u1,u2,u3]/⟨ui2=ui,uiuj=ujui=0⟩ and FqR={(a,d)|a∈Fq,d∈R}, where q=pm, p is a prime, and m∈N+. We investigate the algebraic structure of the non-separable constacyclic codes over the mixed-alphabet ring FqR and then determine the generator polynomials and the dimensions of their hulls. As an application, using the construction X, we obtain some new quantum error-correcting codes that are not listed in the online quantum codes database.

Entropy•Sep 17, 2026•0 citations

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

QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over $\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)$

Rabia Zengin, Mehmet E. Köroğlu

In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring $\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)$, where $v^2 = v$. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.

arXiv:2606.02137•Jun 1, 2026•0 citations

Quantum codes from constacyclic codes over $S_{k}$

Bo Hyun Kong, Xiying Zheng

Abstract Let $S_{k}={\mathbb{F}}_{q}[u_{1},u_{2},\ldots ,u_{k}]/\langle u^{3}_{i}=u_{i},u_{i}u_{j}=u_{j}u_{i}=0 \rangle $ S k = F q [ u 1 , u 2 , … , u k ] / 〈 u i 3 = u i , u i u j = u j u i = 0 〉 , where $1\leq i,j\leq k$ 1 ≤ i , j ≤ k , $q=p^{m}$ q = p m , p is an odd prime. First, we define two new Gray maps $\phi _{k}$ ϕ k and $\varphi _{k}$ φ k , and study their Gray images. Further, we determine the structure of constacyclic codes and their dual codes, and give a necessary and sufficient conditions of constacyclic codes to contain their duals. Finally, we obtain some new quantum codes over $\mathbb{F}_{q}$ F q by using CSS construction, and compare the constructed codes better than the existing literature.

EPJ Quantum Technology•Feb 6, 2023•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
Hulls and sums of separable constacyclic codes over Fq×(Fq+vFq)\mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)Fq​×(Fq​+vFq​) and new quantum codes
We establish the generator polynomials of the Euclidean and Hermitian duals of separable constacyclic codes over S=Fq×(Fq+vFq)\mathcal{S} = \mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)S=Fq​×(Fq​+vFq​), with qqq an odd prime power and v2=vv^2=vv2=v, and we derive the generator polynomials of their Gray images, respectively. The generator polynomials of the Euclidean hulls and Hermitian hulls of separable constacyclic codes over S\mathcal{S}S and their Gray images are presented, respectively. Furthermore, we provide the generator polynomials of the Euclidean sums and Hermitian sums of separable constacyclic codes and their Gray images, respectively. Finally, we propose two methods to yield quantum error-correcting codes (QECCs) from the hulls and sums of separable constacyclic codes over S\mathcal{S}S, and generate new QECCs that outperform the existing ones in terms of parameters.
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
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​.
QEC and EAQEC Codes from Hermitian Sums and Hulls of Cyclic Codes over F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2+v\mathbb{F}_2)F2​×(F2​+vF2​)
In this work, we determine the generator polynomials for the Hermitian hulls and Hermitian sums of cyclic codes defined over the composite ring F2×(F2+vF2)\mathbb{F}_2 \times (\mathbb{F}_2 + v\mathbb{F}_2)F2​×(F2​+vF2​), where v2=vv^2 = vv2=v. Based on these structures, we develop quantum error-correcting (QEC) codes by applying the Hermitian dual version of Quantum Construction~X to the obtained Hermitian hulls and sums. Moreover, by employing matrix product code methods on linear complementary dual (LCD) codes defined over the same ring, we derive families of entanglement-assisted quantum error-correcting (EAQEC) codes.
Quantum codes from constacyclic codes over SkS_{k}Sk​
Abstract Let $S_{k}={\mathbb{F}}_{q}[u_{1},u_{2},\ldots ,u_{k}]/\langle u^{3}_{i}=u_{i},u_{i}u_{j}=u_{j}u_{i}=0 \rangle $ S k = F q [ u 1 , u 2 , … , u k ] / 〈 u i 3 = u i , u i u j = u j u i = 0 〉 , where 1≤i,j≤k1\leq i,j\leq k1≤i,j≤k 1 ≤ i , j ≤ k , q=pmq=p^{m}q=pm q = p m , p is an odd prime. First, we define two new Gray maps ϕk\phi _{k}ϕk​ ϕ k and φk\varphi _{k}φk​ φ k , and study their Gray images. Further, we determine the structure of constacyclic codes and their dual codes, and give a necessary and sufficient conditions of constacyclic codes to contain their duals. Finally, we obtain some new quantum codes over Fq\mathbb{F}_{q}Fq​ F q by using CSS construction, and compare the constructed codes better than the existing literature.
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.