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

Discrete Mathematics Algorithms and Applications

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

Juan Li, Jian Gao, Yongkang Wang

Published Apr 23, 2018• 23 citations
Publisher

Abstract

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.

DOI
10.1142/s1793830918500465

Related papers

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

Quantum codes from cyclic codes over 𝔽q+v𝔽q+v2𝔽q+v3𝔽q

Jian Gao

We give a construction of quantum codes over [Formula: see text] from cyclic codes over a finite non-chain ring [Formula: see text], where [Formula: see text], p is a prime, [Formula: see text] and [Formula: see text].

International Journal of Quantum Information•Dec 1, 2015•41 citations

Constacyclic codes over 𝔽 q 𝒮𝒯 and their applications

Amal S. Alali, Mohd Azmi, Nadeem ur Rehman +1 more

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.

AKCE International Journal of Graphs and Combinatorics•Sep 23, 2024•0 citations

Constacyclic Codes Over 𝑭𝒒[𝒖] /〈𝒖𝟑 = 𝟎〉 and Their Application of Constructing Quantum Codes

Zineb Hebbache

Let 𝑅 = 𝐹𝑞+u𝐹𝑞+𝑢^2𝐹𝑞, 𝑢^3=0 be a finite chain ring. In this paper, we give the structure of constacyclic codes over 𝑅 and obtain self-orthogonal codes over 𝐹𝑞 by using the Gray map from 𝑅𝑛 to 𝐹𝑞^(3𝑛). As an application, we present a construction of quantum codes from the codes obtained from this class.

International Journal of Informatics and Applied Mathematics•Nov 11, 2022•0 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 from Constacyclic Codes over the Ring Fq[u1,u2]/〈 u 1 2 -u1, u 2 2 -u2,u1u2-u2u1〉

Ahmad N. Al‐Kenani, Mohammad Ashraf, Ghulam Mohammad

In this paper, we study the structural properties of ( α + u 1 β + u 2 γ + u 1 u 2 δ ) -constacyclic codes over R = F q [ u 1 , u 2 ] / ⟨ u 1 2 − u 1 , u 2 2 − u 2 , u 1 u 2 − u 2 u 1 ⟩ where q = p m for odd prime p and m ≥ 1 . We derive the generators of constacyclic and dual constacyclic codes. We have shown that Gray image of a constacyclic code of length n is a quasi constacyclic code of length 4 n . Also we have classified all possible self dual linear codes over this ring R . We have given the applications by computing non-binary quantum codes over this ring R .

Mathematics•May 13, 2020•7 citations
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.
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.
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.
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 paper, we study the structural properties of ( α + u 1 β + u 2 γ + u 1 u 2 δ ) -constacyclic codes over R = F q [ u 1 , u 2 ] / ⟨ u 1 2 − u 1 , u 2 2 − u 2 , u 1 u 2 − u 2 u 1 ⟩ where q = p m for odd prime p and m ≥ 1 . We derive the generators of constacyclic and dual constacyclic codes. We have shown that Gray image of a constacyclic code of length n is a quasi constacyclic code of length 4 n . Also we have classified all possible self dual linear codes over this ring R . We have given the applications by computing non-binary quantum codes over this ring R .