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

Cryptography and Communications

BCH codes with explicit minimum distance and applications in quantum synchronizable codes

Xueting Wang, Junling Zhou

Published Jun 16, 2025• 1 citation
Publisher
DOI
10.1007/s12095-025-00815-5

Related papers

Some quantum synchronizable codes with explicit distance

Taoran Liu, Xiaoshan Kai

Journal of Applied Mathematics and Computing•Nov 2, 2022•2 citations

The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes

Xueying Shi, Qin Yue, Yansheng Wu

Designs Codes and Cryptography•Feb 1, 2019•32 citations

Quantum BCH codes with maximum designed distance

Xinmei Huang, Qin Yue, Xiaoping Shi +1 more

Applicable Algebra in Engineering Communication and Computing•Jun 27, 2020•0 citations

A class of negacyclic BCH codes and its application to quantum codes

Shixin Zhu, Zhonghua Sun, Li Ping

Designs Codes and Cryptography•Nov 23, 2017•49 citations

The maximum designed distances of dual-containing non-primitive BCH codes

Fengwei Li, Qin Yue, Daitao Huang

Discrete Mathematics•Jan 26, 2024•2 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
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.