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

Quantum Information and Computation

Quantum codes over a class of finite chain ring

Mustafa Sarı, İrfan Şiap

Published Jan 1, 2016• 2 citations
Publisher

Abstract

In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F_2 [u] / (u^s ) to F^s_2 where F_2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F_2 [u] / (u^s ) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum error correcting (QEC) codes and we finally illustrate our results by presenting some examples with good parameters.

DOI
10.26421/qic16.1-2-3

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

On quantum codes obtained from cyclic codes over A2

Abdullah Dertli, Yasemin Çengellenmiş, Şenol Eren

In this paper, quantum codes from cyclic codes over A2 = F2 + uF2 + vF2 + uvF2, u2 = u, v2 = v, uv = vu, for arbitrary length n have been constructed. It is shown that if C is self orthogonal over A2, then so is Ψ(C), where Ψ is a Gray map. A necessary and sufficient condition for cyclic codes over A2 that contains its dual has also been given. Finally, the parameters of quantum error correcting codes are obtained from cyclic codes over A2.

International Journal of Quantum Information•Apr 1, 2015•68 citations

On Quantum Codes Obtained From Cyclic Codes Over F_2+vF_2+v^2F_2

Abdullah Dertli, Yasemin Çengellenmiş, Şenol Eren

A new Gray map which is both an isometry and a weight preserving map from R=F_2+vF_2+v^2F_2 to (F_2)^3 is defined. A construction for quantum error correcting codes from cyclic codes over finite ring R=F_2+vF_2+v^2F_2, v^3=v is given. The parameters of quantum codes which are obtained from cyclic codes over R are determined.

arXiv:1407.1232•Jun 19, 2014•1 citation

New Non-binary Quantum Codes Over Fq+uFq+vFq+uvFq

Leilei Gao

Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.

International Journal of Discrete Mathematics•Jan 1, 2019•0 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

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•15 citations
In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F_2 [u] / (u^s ) to F^s_2 where F_2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F_2 [u] / (u^s ) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum error correcting (QEC) codes and we finally illustrate our results by presenting some examples with good parameters.
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.
Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.
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 .