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

Theory of Approximation and Applications

Constacyclic Codes over Group Ring (Zq[v])/G

Alireza Soleimani

Published Mar 1, 2019• 0 citations
OpenAlex

Abstract

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum information. The construction of quantum codes via classical codes over 2 F was first introduced by Calderbank and Shor [4] and Steane [13] in 1996. This method, known as CSS construction, has received a lot of attention and it has allowed to find many good quantum stabilizer codes. Later, construction of quantum codes over larger alphabets from classical linear codes over q F has shown by Ketkar et al. in [10]. One direction of the main research in quantum error correction codes is constructing quantum codes that have large minimum distances [9] for a given size and length. In [14], based on classical quaternary constacyclic linear codes, some parameters for quantum codes are obtained. In [8, 9], respectively based on classical negacyclic and constacyclic linear codes some parameters for quantum MDS codes are presented. In this work, we determine self-dual and self-orthogonal codes arising from constacyclic codes over the group ring(Zq[v]/G

Related papers

Quantum Codes from Galois Hulls of Constacyclic Codes over a Finite Non-Chain Ring

Enbin Zhang, Bo Hyun Kong, Xiying Zheng

We study the algebraic structures of constacyclic codes over a new finite non-chain ring R and their l-Galois dual codes based on a new Gray map ϕ and determine the dimensions of the l-Galois hull of constacyclic codes over R. Furthermore, we propose a quantum construction X of the Galois inner product to construct quantum codes by combining the Calderbank–Shor–Steane (CSS) construction, Hermitian construction and construction X. As an application, by calculating the dimensions of the l-Galois hull of constacyclic codes over R, we obtain some new quantum maximum distance separable (QMDS) codes and new quantum error-correcting codes (QECCs) that are better than the best known ones.

Entropy•Apr 3, 2026•1 citation

Quantum codes from negacyclic codes over group ring (Fq+ vFq)G

İrfan Şiap, Mehmet E. Köroğlu

In this paper, we determine self dual and self orthogonal codes arising from negacyclic codes over the group ring (Fq + υFq) G. By taking a suitable Gray image of these codes we obtain many good parameter quantum error-correcting codes over Fq .

•Oct 1, 2016•0 citations

Quantum Codes From Negacyclic Codes over Group Ring (Fq + υFq) G

Mehmet E. Köroğlu, İrfan Şiap

In this paper, we determine self dual and self orthogonal codes arising from negacyclic codes over the group ring ( F q + υF q ) G . By taking a suitable Gray image of these codes we obtain many good parameter quantum error-correcting codes over F q .

Journal of Physics Conference Series•Oct 1, 2016•1 citation

Elementary Constructions of Best Known Quantum Codes

Tran, Long, Nguyen, Trang, Aydin, Nuh

Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.

•Jul 1, 2024•0 citations

Quantum codes over rings

Kenza Guenda, Thomas Aaron Gulliver

This paper considers the construction of quantum error correcting codes from linear codes over finite commutative Frobenius rings. We extend the Calderbank–Shor–Steane (CSS) construction to these rings. Further, quantum codes are extended to matrix product codes. Quantum codes over 𝔽pk are also obtained from linear codes over rings using the generalized Gray map.

International Journal of Quantum Information•Jun 1, 2014•17 citations

Quantum codes derived from constacyclic codes over Z3 [u,v]/

Rekha, Monika Sangwan

The structural properties and construction methodologies of quantum codes (QCs) defined over the finite field Z_3, the finite field with three elements, are examined in this work. The primary focus is on utilizing constacyclic codes within a specific algebraic structure the finite commutative non-chain ring R=Z3+uZ3+vZ3+uvZ3, where the indeterminates u and v satisfy the relations u2=1, v2=1, and uv=vu. We provide a set of idempotent generators of the ring and define linear codes and calculated some self-inverse units. The relationship between R and Z34 is established using a gray map. Constacyclic (CC) codes are broken down into cyclic (C) codes and negacyclic (N) codes in order to determine the parameters of QCs over Z_3. Several QCs of arbitrary lengths are developed as an application. In this paper, we calculated those various parameters of QCs which are better than existing parameters of QCs. This paper contains only those units which have self-inverse.

International Journal of Statistics and Applied Mathematics•Aug 1, 2025•0 citations
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum information. The construction of quantum codes via classical codes over 2 F was first introduced by Calderbank and Shor [4] and Steane [13] in 1996. This method, known as CSS construction, has received a lot of attention and it has allowed to find many good quantum stabilizer codes. Later, construction of quantum codes over larger alphabets from classical linear codes over q F has shown by Ketkar et al. in [10]. One direction of the main research in quantum error correction codes is constructing quantum codes that have large minimum distances [9] for a given size and length. In [14], based on classical quaternary constacyclic linear codes, some parameters for quantum codes are obtained. In [8, 9], respectively based on classical negacyclic and constacyclic linear codes some parameters for quantum MDS codes are presented. In this work, we determine self-dual and self-orthogonal codes arising from constacyclic codes over the group ring(Zq[v]/G
We study the algebraic structures of constacyclic codes over a new finite non-chain ring R and their l-Galois dual codes based on a new Gray map ϕ and determine the dimensions of the l-Galois hull of constacyclic codes over R. Furthermore, we propose a quantum construction X of the Galois inner product to construct quantum codes by combining the Calderbank–Shor–Steane (CSS) construction, Hermitian construction and construction X. As an application, by calculating the dimensions of the l-Galois hull of constacyclic codes over R, we obtain some new quantum maximum distance separable (QMDS) codes and new quantum error-correcting codes (QECCs) that are better than the best known ones.
Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.
The structural properties and construction methodologies of quantum codes (QCs) defined over the finite field Z_3, the finite field with three elements, are examined in this work. The primary focus is on utilizing constacyclic codes within a specific algebraic structure the finite commutative non-chain ring R=Z3+uZ3+vZ3+uvZ3, where the indeterminates u and v satisfy the relations u2=1, v2=1, and uv=vu. We provide a set of idempotent generators of the ring and define linear codes and calculated some self-inverse units. The relationship between R and Z34 is established using a gray map. Constacyclic (CC) codes are broken down into cyclic (C) codes and negacyclic (N) codes in order to determine the parameters of QCs over Z_3. Several QCs of arbitrary lengths are developed as an application. In this paper, we calculated those various parameters of QCs which are better than existing parameters of QCs. This paper contains only those units which have self-inverse.