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:2112.13488

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

Published Dec 27, 2021• 0 citations
arXivHTMLPDF

Abstract

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

DOI
10.48550/arxiv.2112.13488

Related papers

Encoding and Construction of Quantum Codes from $(γ,Δ)$-cyclic Codes over a Class of Non-chain Rings

Om Prakash, Shikha Patel, Habibul Islam

Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(γ,Δ)$-cyclic codes over a class of finite non-chain commutative rings $\mathscr{R}_{q,s}=\mathbb{F}_q[v_1,v_2,\dots,v_s]/\langle v_i-v_i^2,v_iv_j=v_jv_i=0\rangle$ where $γ$ is an automorphism of $\mathscr{R}_{q,s}$, $Δ$ is a $γ$-derivation of $\mathscr{R}_{q,s}$ and $1\leq i\neq j\leq s$ for a positive integer $s$. Here, we show that a $(γ,Δ)$-cyclic code of length $n$ over $\mathscr{R}_{q,s}$ is the direct sum of $(θ,\Im)$-cyclic codes of length $n$ over $\mathbb{F}_q$, where $θ$ is an automorphism of $\mathbb{F}_q$ and $\Im$ is a $θ$-derivation of $\mathbb{F}_q$. Further, necessary and sufficient conditions for both $(γ,Δ)$-cyclic and $(θ,\Im)$-cyclic codes to contain their Euclidean duals are established. Then, we obtain many quantum codes by applying the dual containing criterion on the Gray images of these codes. These codes have better parameters than those available in the literature. Finally, the encoding and error-correction procedures for our proposed quantum codes are discussed.

arXiv:2404.01904•Apr 2, 2024•0 citations

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

Mohammed Sabiri

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.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 3, 2021•2 citations

On Optimal and Quantum Code Construction from Cyclic Codes over FqPQ with Applications

Shakir Ali, Amal S. Alali, Pushpendra Sharma +3 more

The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.

Entropy•Aug 2, 2023•4 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

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

QUANTUM CODES FROM CYCLIC CODES OVER FINITE RING

Jianfa Qian, Wenping Ma, Wangmei Guo

A new method to obtain self-orthogonal codes over finite field F2 is presented. Based on this method, we provide a construction for quantum error-correcting codes starting from cyclic codes over finite ring R = F2 + uF2. As an example, we present infinite families of quantum error-correcting codes which are derived from cyclic codes over the ring R = F2 + uF2.

International Journal of Quantum Information•Sep 1, 2009•90 citations
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​.
Encoding and Construction of Quantum Codes from (γ,Δ)(γ,Δ)(γ,Δ)-cyclic Codes over a Class of Non-chain Rings
Let Fq\mathbb{F}_qFq​ be a finite field of q=pmq=p^mq=pm elements where ppp is a prime and mmm is a positive integer. This paper considers (γ,Δ)(γ,Δ)(γ,Δ)-cyclic codes over a class of finite non-chain commutative rings Rq,s=Fq[v1,v2,…,vs]/⟨vi−vi2,vivj=vjvi=0⟩\mathscr{R}_{q,s}=\mathbb{F}_q[v_1,v_2,\dots,v_s]/\langle v_i-v_i^2,v_iv_j=v_jv_i=0\rangleRq,s​=Fq​[v1​,v2​,…,vs​]/⟨vi​−vi2​,vi​vj​=vj​vi​=0⟩ where γγγ is an automorphism of Rq,s\mathscr{R}_{q,s}Rq,s​, ΔΔΔ is a γγγ-derivation of Rq,s\mathscr{R}_{q,s}Rq,s​ and 1≤i≠j≤s1\leq i\neq j\leq s1≤i=j≤s for a positive integer sss. Here, we show that a (γ,Δ)(γ,Δ)(γ,Δ)-cyclic code of length nnn over Rq,s\mathscr{R}_{q,s}Rq,s​ is the direct sum of (θ,ℑ)(θ,\Im)(θ,ℑ)-cyclic codes of length nnn over Fq\mathbb{F}_qFq​, where θθθ is an automorphism of Fq\mathbb{F}_qFq​ and ℑ\Imℑ is a θθθ-derivation of Fq\mathbb{F}_qFq​. Further, necessary and sufficient conditions for both (γ,Δ)(γ,Δ)(γ,Δ)-cyclic and (θ,ℑ)(θ,\Im)(θ,ℑ)-cyclic codes to contain their Euclidean duals are established. Then, we obtain many quantum codes by applying the dual containing criterion on the Gray images of these codes. These codes have better parameters than those available in the literature. Finally, the encoding and error-correction procedures for our proposed quantum codes are discussed.
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.
The key objective of this paper is to study the cyclic codes over mixed alphabets on the structure of FqPQ, where P=Fq[v]⟨v3−α22v⟩ and Q=Fq[u,v]⟨u2−α12,v3−α22v⟩ are nonchain finite rings and αi is in Fq/{0} for i∈{1,2}, where q=pm with m≥1 is a positive integer and p is an odd prime. Moreover, with the applications, we obtain better and new quantum error-correcting (QEC) codes. For another application over the ring P, we obtain several optimal codes with the help of the Gray image of cyclic codes.
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.