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

arXiv:2112.07137 · International Journal of Theoretical Physics

New Binary Quantum Codes Constructed from Quasi-Cyclic Codes

Chaofeng Guan, Ruihu Li, Liangdong Lü, Yu Yao

Published Jun 1, 2022• 14 citations
arXivHTMLPDF
DOI
10.1007/s10773-022-05126-6

Related papers

A new construction of quantum codes from quasi-cyclic codes over finite fields

Soumak Biswas, Maheshanand Bhaintwal

Indian Journal of Pure and Applied Mathematics•May 16, 2022•3 citations

Construction of New Quantum Stabilizer Codes From Quasi-cyclic Codes Of Index Two

Zhuo Li, Zhenhui Zhang, Lijuan Xing

International Journal of Theoretical Physics•Sep 22, 2025•0 citations

New Quantum Codes Derived from Cyclic Codes

Binbin Pang, Shixin Zhu, Jin Li +1 more

International Journal of Theoretical Physics•Jan 21, 2020•4 citations

New binary quantum codes from Hermitian dual-containing Quasi-cyclic codes

Liangdong Lü, Gaochi Zhang, FENG Ganyu +1 more

In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over $G F(4)$. By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations

New results on binary quasi-cyclic codes

Zhi Chen

Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•4 citations

Lower Bounds for Quasi-Cyclic Codes and New Binary Quantum Codes

Yiting Liu, Chaofeng Guan, Chao Du +1 more

This paper considers three kinds of quasi-cyclic codes of index two with one generator or two generators and their applications in quantum code construction. In accordance with the algebraic structure of linear codes, we determine the lower bounds of the symplectic weights of these quasi-cyclic codes. Quasi-cyclic codes with the dual-containing property enable the construction of quantum codes. Defining the coefficient symmetric polynomials of the generator polynomials gives a concise condition for the dual-containing of the quasi-cyclic codes. The lower bound results can significantly reduce the scope of the search for a larger minimum distance of quasi-cyclic codes. With these algebraic results and computer supports, we obtain classical quasi-cyclic codes with better parameters and some new quantum codes under the symplectic construction. In particular, two examples of the new quantum codes [[63,42,6]]2,[[51,35,5]]2 improve the corresponding codes in Grassl’s code table.

Symmetry•Mar 3, 2023•5 citations
In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over GF(4)G F(4)GF(4). By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.
This paper considers three kinds of quasi-cyclic codes of index two with one generator or two generators and their applications in quantum code construction. In accordance with the algebraic structure of linear codes, we determine the lower bounds of the symplectic weights of these quasi-cyclic codes. Quasi-cyclic codes with the dual-containing property enable the construction of quantum codes. Defining the coefficient symmetric polynomials of the generator polynomials gives a concise condition for the dual-containing of the quasi-cyclic codes. The lower bound results can significantly reduce the scope of the search for a larger minimum distance of quasi-cyclic codes. With these algebraic results and computer supports, we obtain classical quasi-cyclic codes with better parameters and some new quantum codes under the symplectic construction. In particular, two examples of the new quantum codes [[63,42,6]]2,[[51,35,5]]2 improve the corresponding codes in Grassl’s code table.