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

A family of constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ and its application to quantum codes

Yongsheng Tang, Ting Yao, Shixin Zhu, Xiaoshan Kai

Published Dec 6, 2017• 0 citations
arXivHTMLPDF

Abstract

We introduce a Gray map from $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ to $\mathbb{F}_{2}^{2m}$ and study $(1+u)$-constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}},$ where $u^{2}=0.$ It is proved that the image of a $(1+u)$-constacyclic code length $n$ over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ under the Gray map is a distance-invariant quasi-cyclic code of index $m$ and length $2mn$ over $\mathbb{F}_{2}.$ We also prove that every code of length $2mn$ which is the Gray image of cyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ of length $n$ is permutation equivalent to a binary quasi-cyclic code of index $m.$ Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to $(1+u)$-constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}.$

DOI
10.48550/arxiv.1712.02081

Related papers

A Family of Constacyclic Codes over 𝔽 2 m + u 𝔽 2 m and Its Application to Quantum Codes

Yongsheng Tang, Ting Yao, Shixin Zhu +1 more

Let R be the ring 𝔽2m + u𝔽2m, where u2 = 0. We introduce a Gray map from R to 𝔽22m and study (1 + u)-constacyclic codes over R. It is proved that the image of a (1 + u)-constacyclic code length n over R under the Gray map is a distance-invariant binary quasicyclic code of index m and length 2mn. We also prove that every code of length 2mn which is the Gray image of cyclic codes over R of length n is permutation equivalent to a binary quasi-cyclic code of index m. Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to (1 + u)-constacyclic codes over R.

Chinese Journal of Electronics•Jan 1, 2020•4 citations

Some new Quantum Codes and LCD Codes over a finite non-chain ring

Mohammed Sabiri

Let $\mathcal{T} = {\mathbb{F}_{{p^s}}} + {u_1}{\mathbb{F}_{{p^s}}} + {u_2}{\mathbb{F}_{{p^s}}} + {u_3}{\mathbb{F}_{{p^s}}} + u_1^2{\mathbb{F}_{{p^s}}}$ be a finite non-chain ring. In this paper, we propose a method of constructing quantum codes and LCD codes from constacyclic codes over $\mathcal{T}$. The first codes are obtained via the Gray map and the Calderbank-Shor-Steane construction from Euclidean dualcontaining constacyclic codes over $\mathcal{T}$. The second codes are obtained as the gray image of consta cyclic codes of LCD codes over $\mathcal{T}$.

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

New non-binary quantum codes from constacyclic codes over $ \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $

Fanghui Ma, Jian Gao, Fang‐Wei Fu

Let $ R = \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $ be a finite non-chain ring, where $ q $ is an odd prime power and $ u^{2} = 1 $, $ v^2 = v $, $ uv = vu $. In this paper, we construct new non-binary 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. By using Calderbank-Shor-Steane (CSS) construction and Hermitian construction from dual-containing ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $, some new non-binary quantum codes are obtained.

Advances in Mathematics of Communications•Jan 1, 2019•47 citations

Cyclic codes over F2 × (F2 + vF2) and binary quantum codes

Fatma Çalışkan, Refia Aksoy

In the present study, we define cyclic codes over the commutative principal ideal ring F2 ? (F2 + vF2) with v2 = v and obtain some results on cyclic codes over F2 ? (F2 + vF2). We also investigate the dual of a cyclic code over F2 ? (F2 + vF2) depending on two inner products. We determine a generator polynomial of cyclic codes and give the calculation of the number of cyclic codes over F2 ? (F2 + vF2). Furthermore, we show that the Gray images of a cyclic code over F2 ? (F2 + vF2) of length n are binary quasi-cyclic codes of length 3n and of index 3. We find numerous binary codes as Gray images of cyclic codes over F2 ? (F2 + vF2) and tabulate the optimal ones. Moreover, we show that it is possible to obtain binary quantum error-correcting codes (QECCs) from cyclic codes over F2 ? (F2 + vF2).

Filomat•Jan 1, 2023•1 citation

Quantum Codes as an Application of Constacyclic Codes

Mohd Arif Raza, Mohammad Fareed Ahmad, Adel N. Alahmadi +6 more

The main focus of this paper is to analyze the algebraic structure of constacyclic codes over the ring R=Fp+w1Fp+w2Fp+w22Fp+w1w2Fp+w1w22Fp, where w12−α2=0, w1w2=w2w1, w23−β2w2=0, and α,β∈Fp∖{0}, for a prime p. We begin by introducing a Gray map defined over R, which is associated with an invertible matrix. We demonstrate its advantages over the canonical Gray map through some examples. Finally, we create new and improved quantum codes from constacyclic codes over R using Calderbank–Shore–Steane (CSS) construction.

Axioms•Oct 8, 2024•1 citation

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
A family of constacyclic codes over F2m+uF2m\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}F2m​+uF2m​ and its application to quantum codes
We introduce a Gray map from F2m+uF2m\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}F2m​+uF2m​ to F22m\mathbb{F}_{2}^{2m}F22m​ and study (1+u)(1+u)(1+u)-constacyclic codes over F2m+uF2m,\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}},F2m​+uF2m​, where u2=0.u^{2}=0.u2=0. It is proved that the image of a (1+u)(1+u)(1+u)-constacyclic code length nnn over F2m+uF2m\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}F2m​+uF2m​ under the Gray map is a distance-invariant quasi-cyclic code of index mmm and length 2mn2mn2mn over F2.\mathbb{F}_{2}.F2​. We also prove that every code of length 2mn2mn2mn which is the Gray image of cyclic codes over F2m+uF2m\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}F2m​+uF2m​ of length nnn is permutation equivalent to a binary quasi-cyclic code of index m.m.m. Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to (1+u)(1+u)(1+u)-constacyclic codes over F2m+uF2m.\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}.F2m​+uF2m​.
Let R be the ring 𝔽2m + u𝔽2m, where u2 = 0. We introduce a Gray map from R to 𝔽22m and study (1 + u)-constacyclic codes over R. It is proved that the image of a (1 + u)-constacyclic code length n over R under the Gray map is a distance-invariant binary quasicyclic code of index m and length 2mn. We also prove that every code of length 2mn which is the Gray image of cyclic codes over R of length n is permutation equivalent to a binary quasi-cyclic code of index m. Furthermore, a family of quantum error-correcting codes obtained from the Calderbank-Shor-Steane (CSS) construction applied to (1 + u)-constacyclic codes over R.
Let T=Fps+u1Fps+u2Fps+u3Fps+u12Fps\mathcal{T} = {\mathbb{F}_{{p^s}}} + {u_1}{\mathbb{F}_{{p^s}}} + {u_2}{\mathbb{F}_{{p^s}}} + {u_3}{\mathbb{F}_{{p^s}}} + u_1^2{\mathbb{F}_{{p^s}}}T=Fps​+u1​Fps​+u2​Fps​+u3​Fps​+u12​Fps​ be a finite non-chain ring. In this paper, we propose a method of constructing quantum codes and LCD codes from constacyclic codes over T\mathcal{T}T. The first codes are obtained via the Gray map and the Calderbank-Shor-Steane construction from Euclidean dualcontaining constacyclic codes over T\mathcal{T}T. The second codes are obtained as the gray image of consta cyclic codes of LCD codes over T\mathcal{T}T.
Let $ R = \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $ be a finite non-chain ring, where $ q $ is an odd prime power and $ u^{2} = 1 $, $ v^2 = v $, $ uv = vu .Inthispaper,weconstructnewnon−binaryquantumcodesfrom(. In this paper, we construct new non-binary quantum codes from (.Inthispaper,weconstructnewnon−binaryquantumcodesfrom( \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R .Wegivethestructureof(. We give the structure of (.Wegivethestructureof( \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $ and obtain self-orthogonal codes over $ \mathbb{F}_q $ by Gray map. By using Calderbank-Shor-Steane (CSS) construction and Hermitian construction from dual-containing ($ \alpha+\beta u+\gamma v+\delta uv $)-constacyclic codes over $ R $, some new non-binary quantum codes are obtained.
In the present study, we define cyclic codes over the commutative principal ideal ring F2 ? (F2 + vF2) with v2 = v and obtain some results on cyclic codes over F2 ? (F2 + vF2). We also investigate the dual of a cyclic code over F2 ? (F2 + vF2) depending on two inner products. We determine a generator polynomial of cyclic codes and give the calculation of the number of cyclic codes over F2 ? (F2 + vF2). Furthermore, we show that the Gray images of a cyclic code over F2 ? (F2 + vF2) of length n are binary quasi-cyclic codes of length 3n and of index 3. We find numerous binary codes as Gray images of cyclic codes over F2 ? (F2 + vF2) and tabulate the optimal ones. Moreover, we show that it is possible to obtain binary quantum error-correcting codes (QECCs) from cyclic codes over F2 ? (F2 + vF2).
The main focus of this paper is to analyze the algebraic structure of constacyclic codes over the ring R=Fp+w1Fp+w2Fp+w22Fp+w1w2Fp+w1w22Fp, where w12−α2=0, w1w2=w2w1, w23−β2w2=0, and α,β∈Fp∖{0}, for a prime p. We begin by introducing a Gray map defined over R, which is associated with an invertible matrix. We demonstrate its advantages over the canonical Gray map through some examples. Finally, we create new and improved quantum codes from constacyclic codes over R using Calderbank–Shore–Steane (CSS) construction.
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.