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

AKCE International Journal of Graphs and Combinatorics

Constacyclic codes over 𝔽 q 𝒮𝒯 and their applications

Amal S. Alali, Mohd Azmi, Nadeem ur Rehman, Mohammad Fareed Ahmad

Published Sep 23, 2024• 0 citations
Publisher

Abstract

Let [Formula: see text], where p is an odd prime and r is a positive integer. Consider a ring [Formula: see text], where [Formula: see text] with [Formula: see text] and [Formula: see text] with [Formula: see text]. In this paper, we examine the algebraic structure of constacyclic codes over the ring [Formula: see text] of block length [Formula: see text]. Further, a construction of quantum error-correcting codes (QECCs) from constacyclic codes over [Formula: see text] is also given. Moreover, we derive a number of new QECCs.

DOI
10.1080/09728600.2024.2395336

Related papers

Quantum error correction through constacyclic codes over mixed alphabet

Mohd Azmi, Mohammad Fareed Ahmad, Nadeem ur Rehman +1 more

Let q=pr, where p is an odd prime and r be a positive integer, 𝒮=𝔽q[u]〈u2−1〉 and 𝒯=𝔽q[u,v]〈u2−1,v2−1,uv=vu〉 and Ω=(ω1,ω2,ω3)∈𝔽q𝒮𝒯⁠. The algebraic structure of constacyclic codes over 𝔽q𝒮𝒯−Ω–constacyclic code of block length (l, m, n) is examined in this paper. The construction of quantum error-correcting codes (QECCs) from constacyclic codes over 𝔽q𝒮𝒯 is also covered in this paper and we derive some new QECCs.

AIP conference proceedings•Jan 1, 2026•0 citations

New optimal asymmetric quantum codes constructed from constacyclic codes

Genqi Xu, Ruihu Li, Luobin Guo +1 more

In this paper, we propose the construction of asymmetric quantum codes from two families of constacyclic codes over finite field [Formula: see text] of code length [Formula: see text], where for the first family, [Formula: see text] is an odd prime power with the form [Formula: see text] ([Formula: see text] is integer) or [Formula: see text] ([Formula: see text] is integer) and [Formula: see text]; for the second family, [Formula: see text] is an odd prime power with the form [Formula: see text] or [Formula: see text] ([Formula: see text] is integer) and [Formula: see text]. As a result, families of new asymmetric quantum codes [Formula: see text] with [Formula: see text] distance larger than [Formula: see text] are obtained, which are not covered by the asymmetric quantum error-correcting codes (AQECCs) in Refs. 32 and 33 [J.-Z. Chen, J.-P. Li and J. Lin, Int. J. Theor. Phys. 53, 72 (2014); L. Wang and S. Zhu, Int. J. Quantum Inf. 12, 1450017 (2014)] that [Formula: see text]. Also, all the newly obtained asymmetric quantum codes are optimal according to the singleton bound for asymmetric quantum codes.

International Journal of Modern Physics B•Nov 24, 2016•14 citations

Quantum codes from (1 − 2v)-constacyclic codes over the ring 𝔽q + u𝔽q + v𝔽q + uv𝔽q

Juan Li, Jian Gao, Yongkang Wang

In this paper, structural properties of [Formula: see text]-constacyclic codes over the finite non-chain ring [Formula: see text] are studied, where [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] is a power of some odd prime. As an application, some better quantum codes, compared with previous work, are obtained.

Discrete Mathematics Algorithms and Applications•Apr 23, 2018•23 citations

Quantum codes from a class of constacyclic codes over finite commutative rings

Hai Quang Dinh, Tushar Bag, Ashish Kumar Upadhyay +3 more

Let [Formula: see text] be an odd prime, and [Formula: see text] be an integer such that [Formula: see text]. Using pairwise orthogonal idempotents [Formula: see text] of the ring [Formula: see text], with [Formula: see text], [Formula: see text] is decomposed as [Formula: see text], which contains the ring [Formula: see text] as a subring. It is shown that, for [Formula: see text], [Formula: see text], and it is invertible if and only if [Formula: see text] and [Formula: see text] are units of [Formula: see text]. In such cases, we study [Formula: see text]-constacyclic codes over [Formula: see text]. We present a direct sum decomposition of [Formula: see text]-constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a [Formula: see text]-constacyclic code to contain its dual are obtained. As an application, many new quantum codes over [Formula: see text], with better parameters than existing ones, are constructed from cyclic and negacyclic codes over [Formula: see text].

Journal of Algebra and Its Applications•Oct 31, 2019•25 citations

Quantum Codes Obtained From Constacyclic Codes Over a Family of Finite Rings Fp[u₁, u₂, …, us]

Hai Quang Dinh, Tushar Bag, Sachin Pathak +2 more

In this article, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over Rs= Fp+ u1Fp+ ··· + usFp, ui2= ui, uiuj= ujui= 0, for odd prime p and i, j = 1, 2,⋯, s, i ≠ j. Many QECCs with improved parameters than the existing ones in some of the earlier papers are provided. We present a set of idempotent generators of the ring Rs, and using that we define linear codes, determine all units, and study constacyclic codes over this ring. Among others, we study dual containing constacyclic codes over Rs and construct (non-binary) QECCs. An algorithm to construct QECCs from dual containing constacyclic codes over Rs is obtained that can provide many quantum codes.

IEEE Access•Jan 1, 2020•12 citations

New quantum codes from constacyclic codes over a general non-chain ring

Swati Bhardwaj, Mokshi Goyal, Madhu Raka

Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.

arXiv:2212.02821•Discrete Mathematics Algorithms and Applications•Aug 18, 2023•11 citations
Let [Formula: see text], where p is an odd prime and r is a positive integer. Consider a ring [Formula: see text], where [Formula: see text] with [Formula: see text] and [Formula: see text] with [Formula: see text]. In this paper, we examine the algebraic structure of constacyclic codes over the ring [Formula: see text] of block length [Formula: see text]. Further, a construction of quantum error-correcting codes (QECCs) from constacyclic codes over [Formula: see text] is also given. Moreover, we derive a number of new QECCs.
In this paper, we propose the construction of asymmetric quantum codes from two families of constacyclic codes over finite field [Formula: see text] of code length [Formula: see text], where for the first family, [Formula: see text] is an odd prime power with the form [Formula: see text] ([Formula: see text] is integer) or [Formula: see text] ([Formula: see text] is integer) and [Formula: see text]; for the second family, [Formula: see text] is an odd prime power with the form [Formula: see text] or [Formula: see text] ([Formula: see text] is integer) and [Formula: see text]. As a result, families of new asymmetric quantum codes [Formula: see text] with [Formula: see text] distance larger than [Formula: see text] are obtained, which are not covered by the asymmetric quantum error-correcting codes (AQECCs) in Refs. 32 and 33 [J.-Z. Chen, J.-P. Li and J. Lin, Int. J. Theor. Phys. 53, 72 (2014); L. Wang and S. Zhu, Int. J. Quantum Inf. 12, 1450017 (2014)] that [Formula: see text]. Also, all the newly obtained asymmetric quantum codes are optimal according to the singleton bound for asymmetric quantum codes.
Let [Formula: see text] be an odd prime, and [Formula: see text] be an integer such that [Formula: see text]. Using pairwise orthogonal idempotents [Formula: see text] of the ring [Formula: see text], with [Formula: see text], [Formula: see text] is decomposed as [Formula: see text], which contains the ring [Formula: see text] as a subring. It is shown that, for [Formula: see text], [Formula: see text], and it is invertible if and only if [Formula: see text] and [Formula: see text] are units of [Formula: see text]. In such cases, we study [Formula: see text]-constacyclic codes over [Formula: see text]. We present a direct sum decomposition of [Formula: see text]-constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a [Formula: see text]-constacyclic code to contain its dual are obtained. As an application, many new quantum codes over [Formula: see text], with better parameters than existing ones, are constructed from cyclic and negacyclic codes over [Formula: see text].
In this article, we construct some MDS quantum error-correcting codes (QECCs) from classes of constacyclic codes over Rs= Fp+ u1Fp+ ··· + usFp, ui2= ui, uiuj= ujui= 0, for odd prime p and i, j = 1, 2,⋯, s, i ≠ j. Many QECCs with improved parameters than the existing ones in some of the earlier papers are provided. We present a set of idempotent generators of the ring Rs, and using that we define linear codes, determine all units, and study constacyclic codes over this ring. Among others, we study dual containing constacyclic codes over Rs and construct (non-binary) QECCs. An algorithm to construct QECCs from dual containing constacyclic codes over Rs is obtained that can provide many quantum codes.
Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.