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

Quantum Information Processing

On the duals of quasi-cyclic codes and their application to quantum codes

Shivanshu Benjwal, Maheshanand Bhaintwal

Published Mar 23, 2024• 5 citations
Publisher
DOI
10.1007/s11128-024-04318-9

Related papers

On construction of quantum codes with dual-containing quasi-cyclic codes

Chaofeng Guan, Ruihu Li, Liangdong Lü +2 more

arXiv:2210.08716•Quantum Information Processing•Jul 26, 2022•15 citations

Construction of self-orthogonal quasi-cyclic codes and their application to quantum error-correcting codes

Mengying Gao, Yuhua Sun, Tongjiang Yan +1 more

arXiv:2507.17319•Quantum Information Processing•Aug 7, 2026•1 citation

One-generator quasi-cyclic codes and their dual codes

Kanat Abdukhalikov, Tushar Bag, Daniel Panario

Discrete Mathematics•Feb 15, 2023•14 citations

Galois duals of 1-generator quasi-twisted codes and their applications in quantum codes construction

Yongkang Shao, Jian Gao, Jiafu Mi +1 more

Quantum Information Processing•Jan 9, 2026•1 citation

Good self-dual generalized quasi-cyclic codes exist

Minjia Shi, Liqin Qian, Yan Liu +1 more

arXiv:1601.02437•Information Processing Letters•Sep 21, 2016•13 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
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.