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

Journal of Information and Computational Science

Quantum Codes from Cyclic Codes over $F_2+vF_2$

Jianfa Qian

Published Apr 10, 2013• 58 citations
Publisher
DOI
10.12733/jics20101705

Related papers

Entanglement-assisted binary quantum codes from skew cyclic codes over $${\mathbb {F}}_2 \times ({\mathbb {F}}_2+v{\mathbb {F}}_2)$$

Fatma Çalışkan, Refia Aksoy, Nuh Aydın +1 more

Quantum Information Processing•May 10, 2023•1 citation

On Quantum Codes Obtained From Cyclic Codes Over $\F_2+u\F_2+u^2\F_2$

Sukhamoy Pattanayak, Abhay Kumar Singh, Pratyush Kumar

•Jan 11, 2016•0 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 from cyclic codes over $$F_q+uF_q+vF_q+uvF_q$$ F q + u F q + v F q + u v F q

Mohammad Ashraf, Ghulam Mohammad

Quantum Information Processing•Jul 11, 2016•85 citations

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 +1 more

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

arXiv:1712.02081•Dec 6, 2017•0 citations

Quantum Codes Obtained from Some Constacyclic Codes Over a Family of Finite Rings $$F_{p}+uF_{p}+vF_{p}$$

Abdullah Dertli, Yasemin Çengellenmiş

Mathematics in Computer Science•Dec 17, 2019•3 citations
Quantum Codes from Cyclic Codes over F2+vF2F_2+vF_2F2​+vF2​
Entanglement-assisted binary quantum codes from skew cyclic codes over F2×(F2+vF2){\mathbb {F}}_2 \times ({\mathbb {F}}_2+v{\mathbb {F}}_2)F2​×(F2​+vF2​)
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).
Quantum codes from cyclic codes over Fq+uFq+vFq+uvFqF_q+uF_q+vF_q+uvF_qFq​+uFq​+vFq​+uvFq​ F q + u F q + v F q + u v F q
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​.
Quantum Codes Obtained from Some Constacyclic Codes Over a Family of Finite Rings Fp+uFp+vFpF_{p}+uF_{p}+vF_{p}Fp​+uFp​+vFp​