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

AIMS Mathematics

Quantum codes from $ \sigma $-dual-containing constacyclic codes over $ \mathfrak{R}_{l, k} $

Xiying Zheng, Bo Hyun Kong, Yu Yao

Published Jan 1, 2023• 1 citation
Publisher

Abstract

Let $ \mathfrak{R}_{l, k} = {\mathbb F}_{p^m}[u_1, u_2, \cdots, u_k]/ \langle u_{i}^{l} = u_{i}, u_iu_j = u_ju_i = 0 \rangle $, where $ p $ is a prime, $ l $ is a positive integer, $ (l-1)\mid(p-1) $ and $ 1\leq i, j\leq k $. First, we define a Gray map $ \phi_{l, k} $ from $ \mathfrak{R}_{l, k}^n $ to $ {\mathbb F}_{p^m}^{((l-1)k+1)n} $, and study its Gray image. Further, we study the algebraic structure of $ \sigma $-self-orthogonal and $ \sigma $-dual-containing constacyclic codes over $ \mathfrak{R}_{l, k} $, and give the necessary and sufficient conditions for $ \lambda $-constacyclic codes over $ \mathfrak{R}_{l, k} $ to satisfy $ \sigma $-self-orthogonal and $ \sigma $-dual-containing. Finally, we construct quantum codes from $ \sigma $-dual-containing constacyclic codes over $ \mathfrak{R}_{l, k} $ using the CSS construction or Hermitian construction and compare new codes our obtained better than the existing codes in some recent references.

DOI
10.3934/math.20231227

Related papers

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

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•19 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

New non-binary quantum codes from skew constacyclic codes over the ring F p m +v{F p m +v 2 F p m .

Ram Krishna Verma, Om Prakash, Ashutosh Kumar 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}$.

•Jan 1, 2020•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

Equivalence of constacyclic codes over finite non-chain ring and quantum codes

Jie Liu, Xiying Zheng

Let $ \mathfrak {R}_{l} = {\mathbb F}_{q}[u]/ \langle u^{l}-u \rangle $, where $ q = p^m $, $ p $ is a prime, and $ m \in \mathbf{N^+} $, $ (l-1)\mid(p-1) $. First, we study isometry and equivalence between constacyclic codes over $ \mathfrak{R}_{l} $, and we present the equivalence conditions for $ (e_1a_1+e_2a_2+\cdots+e_{l}a_{l}) $-constacyclic code and $ (e_1b_1+e_2b_2+\cdots+e_{l}b_{l}) $-constacyclic code. Further, based on the equivalence conditions, we classify constacyclic codes over $ \mathfrak{R}_{l} $. Finally, based on the equivalence of constacyclic codes over $ \mathfrak{R}_{l} $ and CSS construction, we construct some new quantum codes that are better than the existing codes in some recent references.

AIMS Mathematics•Jan 1, 2025•0 citations
Let Rl,k=Fpm[u1,u2,⋯ ,uk]/⟨uil=ui,uiuj=ujui=0⟩\mathfrak{R}_{l, k} = {\mathbb F}_{p^m}[u_1, u_2, \cdots, u_k]/ \langle u_{i}^{l} = u_{i}, u_iu_j = u_ju_i = 0 \rangleRl,k​=Fpm​[u1​,u2​,⋯,uk​]/⟨uil​=ui​,ui​uj​=uj​ui​=0⟩, where ppp is a prime, lll is a positive integer, (l−1)∣(p−1)(l-1)\mid(p-1)(l−1)∣(p−1) and 1≤i,j≤k1\leq i, j\leq k1≤i,j≤k. First, we define a Gray map ϕl,k\phi_{l, k}ϕl,k​ from Rl,kn\mathfrak{R}_{l, k}^nRl,kn​ to Fpm((l−1)k+1)n{\mathbb F}_{p^m}^{((l-1)k+1)n}Fpm((l−1)k+1)n​, and study its Gray image. Further, we study the algebraic structure of σ\sigmaσ-self-orthogonal and σ\sigmaσ-dual-containing constacyclic codes over Rl,k\mathfrak{R}_{l, k}Rl,k​, and give the necessary and sufficient conditions for λ\lambdaλ-constacyclic codes over Rl,k\mathfrak{R}_{l, k}Rl,k​ to satisfy σ\sigmaσ-self-orthogonal and σ\sigmaσ-dual-containing. Finally, we construct quantum codes from σ\sigmaσ-dual-containing constacyclic codes over Rl,k\mathfrak{R}_{l, k}Rl,k​ using the CSS construction or Hermitian construction and compare new codes our obtained better than the existing codes in some recent references.
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.
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 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.
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​.
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​.
Let $ \mathfrak {R}_{l} = {\mathbb F}_{q}[u]/ \langle u^{l}-u \rangle $, where $ q = p^m $, $ p $ is a prime, and $ m \in \mathbf{N^+} $, $ (l-1)\mid(p-1) $. First, we study isometry and equivalence between constacyclic codes over $ \mathfrak{R}_{l} $, and we present the equivalence conditions for $ (e_1a_1+e_2a_2+\cdots+e_{l}a_{l}) $-constacyclic code and $ (e_1b_1+e_2b_2+\cdots+e_{l}b_{l}) $-constacyclic code. Further, based on the equivalence conditions, we classify constacyclic codes over $ \mathfrak{R}_{l} $. Finally, based on the equivalence of constacyclic codes over $ \mathfrak{R}_{l} $ and CSS construction, we construct some new quantum codes that are better than the existing codes in some recent references.