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

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, Paravee Maneejuk

Published Jan 1, 2021• 7 citations
Publisher

Abstract

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.

DOI
10.1109/access.2021.3117561

Related papers

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

Hai Quang Dinh, Bac Trong Nguyen, Woraphon Yamaka

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.

IEEE Access•Jan 1, 2020•17 citations

Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes

Lan Luo, Zhi Ma

In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths psand lpsover Fq, where s 1 andl ≥ 2 are integers, and p ≥ 3 is the odd characteristic. Within some loose limitations, these synchronizable codes can possess the best possible capability in synchronization recovery, and therefore, enriches the variety of good quantum synchronizable codes. Furthermore, by using known techniques in classical coding theory which convert the computation of the minimum distance of a repeated-root cyclic code to that of a shorter simple-root cyclic code, we prove that the repeated-root cyclic codes of lengths ps and l ps are in general better than narrow-sense BCH codes of close lengths in terms of minimum distances, and thereby enable the obtained synchronizable codes to correct more Pauli errors.

IEEE Transactions on Information Theory•Jan 19, 2018•38 citations

Quantum Synchronizable Codes From the Cyclotomy of Order Four

Lanqiang Li, Shixin Zhu, Li Liu

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes (QECCs) that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct two classes of QSCs from the cyclic codes which are obtained by the cyclotomic classes of order four. The QSCs constructed are Calderbank-Shor-Steane QECCs which can tolerate maximum number of misalignment errors. Moreover, the QSCs usually possess good error-correcting capability towards bit error and phase error, due to many cyclic codes employed to construct QSCs are optimal or almost optimal.

IEEE Communications Letters•Oct 25, 2018•22 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

Quantum Codes Constructed From Repeated-Root Cyclic Codes

Ruihu Li, Hao Song, Yuena Ma +1 more

In this paper, we use q -cyclotomic cosets modulo n = q − 1 and generator polynomial to describe repeated-root cyclic codes of length N = p α n . We determine the condition under which a repeated-root cyclic code contains its dual code. Then, for q = 2 a , we give a class of dual-containing repeated-root cyclic codes. Applying CSS construction and Steane construction to these underlying classical codes, many quantum codes with good parameters shall be constructed, which are new in the sense that they are not available in the literature.

Journal of Physics Conference Series•Aug 1, 2018•1 citation

A New Class of Quantum Synchronizable Codes Derived From Coset Codes

Fan Ju

Quantum synchronizable codes (QSCs) are designed to correct both Pauli errors and synchronization misalignment. In this letter, we introduce a new framework for constructing QSCs based on classical coset codes. This construction is versatile, yielding codes for both random and, notably, burst errors, thereby extending the scope of existing QSC designs. The resulting codes exhibit two notable properties: they fully preserve the phase-error-correction capability of their parent Calderbank-Shor-Steane (CSS) codes, and in the absence of misalignment, they revert to the full error-correcting power of the parent codes.

IEEE Communications Letters•Oct 27, 2025•0 citations
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.
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 paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths psand lpsover Fq, where s 1 andl ≥ 2 are integers, and p ≥ 3 is the odd characteristic. Within some loose limitations, these synchronizable codes can possess the best possible capability in synchronization recovery, and therefore, enriches the variety of good quantum synchronizable codes. Furthermore, by using known techniques in classical coding theory which convert the computation of the minimum distance of a repeated-root cyclic code to that of a shorter simple-root cyclic code, we prove that the repeated-root cyclic codes of lengths ps and l ps are in general better than narrow-sense BCH codes of close lengths in terms of minimum distances, and thereby enable the obtained synchronizable codes to correct more Pauli errors.
Quantum synchronizable codes (QSCs) are special quantum error-correcting codes (QECCs) that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct two classes of QSCs from the cyclic codes which are obtained by the cyclotomic classes of order four. The QSCs constructed are Calderbank-Shor-Steane QECCs which can tolerate maximum number of misalignment errors. Moreover, the QSCs usually possess good error-correcting capability towards bit error and phase error, due to many cyclic codes employed to construct QSCs are optimal or almost optimal.
In this paper, we use q -cyclotomic cosets modulo n = q − 1 and generator polynomial to describe repeated-root cyclic codes of length N = p α n . We determine the condition under which a repeated-root cyclic code contains its dual code. Then, for q = 2 a , we give a class of dual-containing repeated-root cyclic codes. Applying CSS construction and Steane construction to these underlying classical codes, many quantum codes with good parameters shall be constructed, which are new in the sense that they are not available in the literature.
Quantum synchronizable codes (QSCs) are designed to correct both Pauli errors and synchronization misalignment. In this letter, we introduce a new framework for constructing QSCs based on classical coset codes. This construction is versatile, yielding codes for both random and, notably, burst errors, thereby extending the scope of existing QSC designs. The resulting codes exhibit two notable properties: they fully preserve the phase-error-correction capability of their parent Calderbank-Shor-Steane (CSS) codes, and in the absence of misalignment, they revert to the full error-correcting power of the parent codes.