This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^ς$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces the construction of quantum AMDS (qAMDS) codes, drawing on the principles of the Calderbank-Shor-Steane (CSS) framework, which enhances their applicability in quantum error correction. This work aims to deepen the understanding of these codes and their potential uses in both classical and quantum computing environments.
AMDS and quantum AMDS Constacyclic codes of length 4pς over Fpm
This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length 4pς over the finite field Fpm, where p is an odd prime number. Furthermore, it introduces the construction of quantum AMDS (qAMDS) codes, drawing on the principles of the Calderbank-Shor-Steane (CSS) framework, which enhances their applicability in quantum error correction. This work aims to deepen the understanding of these codes and their potential uses in both classical and quantum computing environments.
In this article, we investigate all almost maximum distance separable (briefly, AMDS) negacyclic codes of length 2psover the finite field Fpm, wherepis an odd prime. A necessary and sufficient condition for a code to be an AMDS and NMDS negacyclic code of length 2psover Fpmis also provided. In addition, we construct quantum AMDS (qAMDS) codes using both the Calderbank-Shor-Steane (CSS) and Hermitian constructions. These newly constructed codes have different parameters compared to previous constructions. Moreover, our qAMDS codes are better than all known quantum error correction (QEC) codes.
Let p be an odd prime, and Fp(m)is the finite field of pmelements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2psover Fp(m)are established. As an application, all quantum MDS (briefly, qMDS) codes are constructed from cyclic and negacyclic codes of length 2psover finite fields using the Calderbank Shor-Steane (briefly, CSS) and Hermitian constructions. These codes are new in the sense that their parameters are different from all the previous constructions. Furthermore, quantum synchronizable codes (briefly, QSCs) are obtained from cyclic codes of length 2psover Fp(m). To enrich the variety of available QSCs, many new QSCs are constructed to illustrate our results. Among them, there are QSCs codes with shorter lengths and much larger minimum distances than known primitive narrow-sense Bose-Chaudhuri-Hocquenghem (briefly, BCH) codes.
For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
A family of constacyclic codes over F2m+uF2m and its application to quantum codes
We introduce a Gray map from F2m+uF2m to F22m and study (1+u)-constacyclic codes over F2m+uF2m, where u2=0. It is proved that the image of a (1+u)-constacyclic code length n over F2m+uF2m under the Gray map is a distance-invariant quasi-cyclic code of index m and length 2mn over F2. We also prove that every code of length 2mn which is the Gray image of cyclic codes over F2m+uF2m 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 F2m+uF2m.
Abstract In this paper, we study skew constacyclic codes over a class of non-chain rings T=Fq[u1,u2,…,ur]/⟨fi(ui),uiuj−ujui⟩i,j=1r, where q=pm, p is some odd prime, m is a positive integer and fi(ui) are non-constant polynomials which split into distinct linear factors. We discuss the structural properties of skew constacyclic codes over T and their dual. We characterize (Euclidean and Hermitian) dual-containing skew constacyclic codes. These characterizations serve as a foundational framework for the development of techniques to construct quantum codes. Consequently, we derive plenty of new quantum codes including many Maximum Distance Separable (MDS) quantum codes, and many quantum codes with better parameters than existing ones. Our work further extends to the characterization of skew constacyclic Euclidean and Hermitian Linear Complementary Dual (LCD) codes over T, and we establish that their Gray images also preserve the LCD property. From this analysis, we derive numerous Maximum Distance Separable (MDS) codes and Best-Known Linear Codes (BKLC) over Fq. MSC Classification: MSC 11T06, MSC 81P70, MSC94B05, MSC 94B15, MSC 94B99
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.