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)

Quantum codes from cyclic codes over Fq + vFq + v2Fq + v3Fq + v4Fq

Mohammed Sabiri

Published Dec 3, 2021• 2 citations
Publisher

Abstract

We give a construction of quantum codes over ${\mathbb{F}_q}$ from cyclic codes over a finite non-chain ring ${\mathbb{F}_q} + v{\mathbb{F}_q} + {v^2}{\mathbb{F}_q} + {v^3}{\mathbb{F}_q} + {v^4}{\mathbb{F}_q}$, where q=pr, p is an odd prime, 4|p−1 and v5=v.

DOI
10.1109/commnet52204.2021.9641899

Related papers

Quantum codes from cyclic codes over 𝔽q+v𝔽q+v2𝔽q+v3𝔽q

Jian Gao

We give a construction of quantum codes over [Formula: see text] from cyclic codes over a finite non-chain ring [Formula: see text], where [Formula: see text], p is a prime, [Formula: see text] and [Formula: see text].

International Journal of Quantum Information•Dec 1, 2015•41 citations

Quantum codes constructed from cyclic codes over the ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q$

Djoko Suprijanto, Hopein Christofen Tang

In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid (p-1),$ and $v^5=v.$ As an application, we construct several quantum error correcting codes over the finite field $\mathbb{F}_q.$

arXiv:2112.13488•Dec 27, 2021•0 citations

On quantum codes obtained from cyclic codes over 𝔽2 + u𝔽2 + u2𝔽2

Abhay Kumar Singh, Sukhamoy Pattanayak, Pratyush Kumar +1 more

In the paper, we consider a finite non-chain commutative ring [Formula: see text], where [Formula: see text]. We mainly study the construction of quantum codes from cyclic codes over [Formula: see text]. For this, we obtained self-orthogonal codes over [Formula: see text] as gray images of linear and cyclic codes over [Formula: see text], then these codes over [Formula: see text] correspond to a cyclic code over [Formula: see text] of odd length [Formula: see text] used to determine the parameters of the quantum codes.

Asian-European Journal of Mathematics•Feb 17, 2017•13 citations

Construction of some new quantum codes

Mohammed Sabiri

In this paper, we consider$R=\mathbb{F}_{q}[u, v]/ < u^{2}-u, v^{2}-v, uv - vu >$which is a finite non-chain ring, where$q$is an odd prime power and$u^{2}=u, v^{2}=v, uv=vu$. We construct new 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.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 12, 2022•4 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

A Study of FqR-Cyclic Codes and Their Applications in Constructing Quantum Codes

Hai Quang Dinh, Sachin Pathak, Tushar Bag +2 more

Let R = Fq+ uFq+ vFq+ uvFq, with u2= u, v2= v, uv = vu, where q = pmfor a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr- 1) × R[x]/(xs- 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.

IEEE Access•Jan 1, 2020•15 citations
We give a construction of quantum codes over Fq{\mathbb{F}_q}Fq​ from cyclic codes over a finite non-chain ring Fq+vFq+v2Fq+v3Fq+v4Fq{\mathbb{F}_q} + v{\mathbb{F}_q} + {v^2}{\mathbb{F}_q} + {v^3}{\mathbb{F}_q} + {v^4}{\mathbb{F}_q}Fq​+vFq​+v2Fq​+v3Fq​+v4Fq​, where q=pr, p is an odd prime, 4|p−1 and v5=v.
Quantum codes constructed from cyclic codes over the ring Fq+vFq+v2Fq+v3Fq+v4Fq\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_qFq​+vFq​+v2Fq​+v3Fq​+v4Fq​
In this article, we investigate properties of cyclic codes over a finite non-chain ring Fq+vFq+v2Fq+v3Fq+v4Fq,\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,Fq​+vFq​+v2Fq​+v3Fq​+v4Fq​, where q=pr,q=p^r,q=pr, rrr is a positive integer, ppp is an odd prime, 4∣(p−1),4 \mid (p-1),4∣(p−1), and v5=v.v^5=v.v5=v. As an application, we construct several quantum error correcting codes over the finite field Fq.\mathbb{F}_q.Fq​.
In the paper, we consider a finite non-chain commutative ring [Formula: see text], where [Formula: see text]. We mainly study the construction of quantum codes from cyclic codes over [Formula: see text]. For this, we obtained self-orthogonal codes over [Formula: see text] as gray images of linear and cyclic codes over [Formula: see text], then these codes over [Formula: see text] correspond to a cyclic code over [Formula: see text] of odd length [Formula: see text] used to determine the parameters of the quantum codes.
In this paper, we considerR=Fq[u,v]/<u2−u,v2−v,uv−vu>R=\mathbb{F}_{q}[u, v]/ < u^{2}-u, v^{2}-v, uv - vu >R=Fq​[u,v]/<u2−u,v2−v,uv−vu>which is a finite non-chain ring, whereqqqis an odd prime power andu2=u,v2=v,uv=vuu^{2}=u, v^{2}=v, uv=vuu2=u,v2=v,uv=vu. We construct new quantum codes from(α+βu+γv+δuv)(\alpha+\beta u+\gamma v+\delta uv)(α+βu+γv+δuv)- constacyclic codes overRRR. We give the structure of(α+βu+γv+δuv)(\alpha+\beta u+\gamma v+\delta uv)(α+βu+γv+δuv)- constacyclic codes overRRRand obtain self-orthogonal codes overFq\mathbb{F}_{q}Fq​by Gray map.
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​.
Let R = Fq+ uFq+ vFq+ uvFq, with u2= u, v2= v, uv = vu, where q = pmfor a positive integer m and an odd prime p. We study the algebraic structure of FqR-cyclic codes of block length (r, s). These codes can be viewed as R[x]-submodules of Fq[x]/(xr- 1) × R[x]/(xs- 1). For this family of codes we discuss the generator polynomials and minimal generating sets. We study the algebraic structure of separable codes. Further, we discuss the duality of this family of codes and determine their generator polynomials. We obtain several optimal and near-optimal codes from this study. As applications, we discuss a construction of quantum error-correcting codes (QECCs) from FqR-cyclic codes and construct some good QECCs.