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

Journal of Physics Conference Series

Quantum Codes Constructed From Repeated-Root Cyclic Codes

Ruihu Li, Hao Song, Yuena Ma, Liangdong Lv

Published Aug 1, 2018• 1 citation
Publisher

Abstract

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.

DOI
10.1088/1742-6596/1069/1/012078

Related papers

QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES

Ruihu Li, Xueliang Li

In this paper, we use 2-cyclotomic cosets of modulo n and generator polynomials to describe binary cyclic codes of length N=2αn with n odd. We discuss the conditions under which two cyclic codes [Formula: see text] and [Formula: see text] can be used to construct quantum codes by CSS construction or Steane's construction. Using the results of Chen, Promhouse and Tavares, and Castagnoli et al., we study the quantum codes that can be constructed from binary cyclic codes of length N=2αn with n odd and n≤99, and α≤2. We find that except the quantum codes constructed by Steane, there are also some very interesting quantum codes constructed from repeated-root cyclic codes, and some of the quantum codes constructed by Steane can be improved.

International Journal of Quantum Information•Jun 1, 2004•27 citations

Linear Quantum Codes Constructed from Quaternary Cyclic Codes

LI Rui-hu

A method of describing quaternary cyclic codes with 4-cyclotomic cosets of modulo odd n and generator polynomials is presented.A necessary and sufficient condition under which a quaternary cyclic code containing its dual code is given,thus generalizing the related known results on self-orthogonal simple root cyclic codes and on BCH codes to al quaternary cyclic codes.Using the relation of simple root cyclic codes and repeat root cyclic codes,the linear quantum codes that can be constructed from quaternary cyclic codes of short lengths are determined.

Journal of Air Force Engineering University•Jan 1, 2007•0 citations

Quantum codes from Hermitian dual-containing cyclic codes

Jiafu Mi, Xiwang Cao, Shanding Xu +1 more

A new criterion for the existence of Hermitian dual-containing cyclic codes is obtained based on a characterization of q-cyclotomic cosets modulo n. This criterion admits a method of constructing new Hermitian dual-containing cyclic codes (hence new quantum codes) from the old ones, and enables us to construct several classes of quantum maximum-distance-separable (MDS) codes from classical Hermitian dual-containing cyclic codes. We analyse that our codes are good in certain sense. Besides, some enumerative conclusions are also presented as a result of the characterization of q-cyclotomic cosets modulo n.

International Journal of Computer Mathematics Computer Systems Theory•May 13, 2017•4 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

Cyclotomic cosets and quantum BCH codes

Fangying Xiao, Hanwu Chen

In order to constructing quantum BCH codes from classical BCH codes using CSS constructing method it needs to determine whether the BCH codes contains its dual. Cyclotomic cosets play very important roles in classical error correction theory and quantum error correction theory. This letter presented several properties of cyclotomic cosets and introduced a method to determine whether a non-primitive BCH code over GF (q) contains its dual. The method presented in this paper with polynomial time complexity can also be applied to nonnarrow sense primitive BCH codes.

International Conference on Natural Computation (ICNC)•Aug 1, 2010•2 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
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.
In this paper, we use 2-cyclotomic cosets of modulo n and generator polynomials to describe binary cyclic codes of length N=2αn with n odd. We discuss the conditions under which two cyclic codes [Formula: see text] and [Formula: see text] can be used to construct quantum codes by CSS construction or Steane's construction. Using the results of Chen, Promhouse and Tavares, and Castagnoli et al., we study the quantum codes that can be constructed from binary cyclic codes of length N=2αn with n odd and n≤99, and α≤2. We find that except the quantum codes constructed by Steane, there are also some very interesting quantum codes constructed from repeated-root cyclic codes, and some of the quantum codes constructed by Steane can be improved.
A method of describing quaternary cyclic codes with 4-cyclotomic cosets of modulo odd n and generator polynomials is presented.A necessary and sufficient condition under which a quaternary cyclic code containing its dual code is given,thus generalizing the related known results on self-orthogonal simple root cyclic codes and on BCH codes to al quaternary cyclic codes.Using the relation of simple root cyclic codes and repeat root cyclic codes,the linear quantum codes that can be constructed from quaternary cyclic codes of short lengths are determined.
A new criterion for the existence of Hermitian dual-containing cyclic codes is obtained based on a characterization of q-cyclotomic cosets modulo n. This criterion admits a method of constructing new Hermitian dual-containing cyclic codes (hence new quantum codes) from the old ones, and enables us to construct several classes of quantum maximum-distance-separable (MDS) codes from classical Hermitian dual-containing cyclic codes. We analyse that our codes are good in certain sense. Besides, some enumerative conclusions are also presented as a result of the characterization of q-cyclotomic cosets modulo n.
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.
In order to constructing quantum BCH codes from classical BCH codes using CSS constructing method it needs to determine whether the BCH codes contains its dual. Cyclotomic cosets play very important roles in classical error correction theory and quantum error correction theory. This letter presented several properties of cyclotomic cosets and introduced a method to determine whether a non-primitive BCH code over GF (q) contains its dual. The method presented in this paper with polynomial time complexity can also be applied to nonnarrow sense primitive BCH codes.