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

IEEE Access

Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2ps Over F pm

Hai Quang Dinh, Bac Trong Nguyen, Woraphon Yamaka

Published Jan 1, 2020• 16 citations
Publisher

Abstract

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.

DOI
10.1109/access.2020.3006001

Related papers

Quantum AMDS Negacyclic Codes of Length 2 p s Over F p m

Hai Quang Dinh, Bac Trong Nguyen, Nui V Nguyen +2 more

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.

IEEE Access•Aug 4, 2025•0 citations

Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps

Hai Quang Dinh, Ha T. Le, Bac Trong Nguyen +1 more

In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length 6ps over Fpm.We obtain several new classes of QEC codes in the sense that their parameters are different from all the previous constructions. Among them, we identify all quantum MDS (briefly, qMDS) codes, i.e., optimal quantum codes with respect to the quantum Singleton bound. In addition, we construct quantum synchronizable codes (briefly, QSCs) from cyclic codes of length 6ps over Fpm. Furthermore, we give many new QSCs to enrich the variety of available QSCs. A lot of them are QSCs codes with shorter lengths and much larger minimum distances than known non-primitive narrow-sense BCH codes.

IEEE Access•Jan 1, 2021•7 citations

New Quantum MDS Codes From Negacyclic Codes

Xiaoshan Kai, Shixin Zhu

Letqbe an odd prime power. Based on classical negacyclic codes, we construct two classes of quantum maximum-distance-separable (MDS) codes with parameters [[q2+1,q2-2d+3,d]]qwhereq≡ 1 (mod 4) and 2 ≤d≤q+1 is even, and [[(q2+1)/2,(q2+1)/2-2d+2,d]]qwhere 3 ≤d≤qis odd. Some of these quantum MDS codes are new in the sense that their parameters are different from all the previously known ones.

IEEE Transactions on Information Theory•Sep 24, 2012•183 citations

New QEC codes and EAQEC codes from repeated-root cyclic codes of length $2^rp^s$

Lanqiang Li, Ziwen Cao, Tingting Wu +1 more

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field $\mathbb{F}_{p^m}$. Through the utilization of CSS and Steane's constructions, a series of new quantum error-correcting (QEC) codes are constructed with parameters distinct from all previous constructions. Furthermore, we provide all maximum distance separable (MDS) cyclic codes of length $2^rp^s$, which are further utilized in the construction of QEC MDS codes. Finally, we introduce a significant number of novel entanglement-assisted quantum error-correcting (EAQEC) codes derived from these repeated-root cyclic codes. Notably, these newly constructed codes exhibit parameters distinct from those of previously known constructions.

arXiv:2406.13943•Jun 20, 2024•0 citations

A Class of Negacyclic Codes and Their Application to Quantum Codes

Junli Wang, Ruihu Li, Yang Liu +1 more

In this paper, the properties of q2-ary cyclotomic cosets modulo 2n are investigated in detail, where n=[(q2m-1)/(m(q-1))],q ≡ ±1mod m or q2≡ -1mod m when m is even and q is an odd power prime when m is power of 2. Then, non-narrow-sense negacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes of length n that contain their Hermitian duals are determined. By the Hermitian construction, series of quantum codes are obtained from such negacyclic BCH codes. Compared with quantum codes in the [6], [10], [12], our constructed ones have better parameters.

International Congress on Image and Signal Processing (CISP)•Oct 1, 2019•0 citations

On non-binary quantum repeated-root cyclic codes

Liqi Wang, Shixin Zhu

In this paper, based on the Steane's enlargement construction, three classes of non-binary quantum codes are constructed from classical repeated-root cyclic codes of length 2ps over 𝔽q with odd characteristic p. The exact minimum distances of these quantum codes are determined. This construction yields a quantum MDS code with parameters [[2p, 2p - 4, 3]]p and two good quantum codes with parameters [[2p, 2p - 7, 4]]p and [[2p, 2p - 10, 5]]p.

International Journal of Quantum Information•Apr 1, 2014•5 citations
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.
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.
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length 6ps over Fpm.We obtain several new classes of QEC codes in the sense that their parameters are different from all the previous constructions. Among them, we identify all quantum MDS (briefly, qMDS) codes, i.e., optimal quantum codes with respect to the quantum Singleton bound. In addition, we construct quantum synchronizable codes (briefly, QSCs) from cyclic codes of length 6ps over Fpm. Furthermore, we give many new QSCs to enrich the variety of available QSCs. A lot of them are QSCs codes with shorter lengths and much larger minimum distances than known non-primitive narrow-sense BCH codes.
New QEC codes and EAQEC codes from repeated-root cyclic codes of length 2rps2^rp^s2rps
Let ppp be an odd prime and r,s,mr,s,mr,s,m be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of 2rps2^rp^s2rps over the finite field Fpm\mathbb{F}_{p^m}Fpm​. Through the utilization of CSS and Steane's constructions, a series of new quantum error-correcting (QEC) codes are constructed with parameters distinct from all previous constructions. Furthermore, we provide all maximum distance separable (MDS) cyclic codes of length 2rps2^rp^s2rps, which are further utilized in the construction of QEC MDS codes. Finally, we introduce a significant number of novel entanglement-assisted quantum error-correcting (EAQEC) codes derived from these repeated-root cyclic codes. Notably, these newly constructed codes exhibit parameters distinct from those of previously known constructions.
In this paper, the properties of q2-ary cyclotomic cosets modulo 2n are investigated in detail, where n=[(q2m-1)/(m(q-1))],q ≡ ±1mod m or q2≡ -1mod m when m is even and q is an odd power prime when m is power of 2. Then, non-narrow-sense negacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes of length n that contain their Hermitian duals are determined. By the Hermitian construction, series of quantum codes are obtained from such negacyclic BCH codes. Compared with quantum codes in the [6], [10], [12], our constructed ones have better parameters.