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

Frontiers of Computer Science

Optimal binary codes and binary construction of quantum codes

Weiliang Wang, Yangyu Fan, Ruihu Li

Published Oct 22, 2014• 4 citations
Publisher
DOI
10.1007/s11704-014-3469-z

Related papers

Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication

Yansheng Wu, Yoonjin Lee

It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n≥7. We also find some (almost) “optimal” quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.

Mathematics•Sep 3, 2020•8 citations

New Binary Quantum Codes Constructed from Quasi-Cyclic Codes

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

arXiv:2112.07137•International Journal of Theoretical Physics•Jun 1, 2022•14 citations

Optimal, Best-Known Divisible Binary Codes and Related Quantum Codes

Hao Chen, Cong Yu, Yaqi Chen +3 more

Divisible codes have been studied for many years, since the divisibility theorem on binary cyclic codes was proved by R. J. McEliece in 1972 and divisible codes were introduced by H. N. Ward in 1981. It is well-known that doubly even (4-divisible) binary codes can be used to construct stabilizer quantum codes. Triorthogonal binary codes and CSS-T pairs of binary codes were introduced to construct CSS-T quantum codes. In this paper, we show that 8-divisible (triply even) binary linear codes are triorthogonal codes and CSS-T pairs of codes can be obtained from 8-divisible codes directly. Infinitely many infinite families of$2^{r}$-divisible optimal binary codes are presented, for an arbitrarily large positive integer$r$. Seventeen doubly even (self-orthogonal) binary cyclic codes and five triply even binary cyclic codes with their minimum weights equal to the minimum weights of best-known linear codes are found. An infinite family of rate around$\frac {1}{2}$explicit doubly even (self-orthogonal) binary cyclic codes with the lower bound$\frac {n_{i}}{\log n_{i}}$on their minimum distances and the lower bound$\sqrt {\frac {n_{i}}{2}}$on their dual distances is constructed. This is much stronger than the main results in two previous papers published in IEEE Transactions on Information Theory, 2022 and 2024 by C. Ding, C. Tang, Z. Sun and C. Li. Many CSS-T quantum codes with new parameters are constructed. Many stabilizer quantum codes given in this paper have distances close to the best-known ones documented in Grassl’s database.

IEEE Transactions on Information Theory•Aug 4, 2026•0 citations

Some new constructions of optimal asymmetric quantum codes

Guohui Wang, Chunming Tang, Weiming Wei

Quantum Information Processing•Jan 19, 2023•6 citations

Binary Construction of Quantum Codes of Minimum Distance Three and Four

Ruihu Li, Xinran Li

We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.

IEEE Transactions on Information Theory•Jun 1, 2004•68 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations
It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n≥7. We also find some (almost) “optimal” quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.
Divisible codes have been studied for many years, since the divisibility theorem on binary cyclic codes was proved by R. J. McEliece in 1972 and divisible codes were introduced by H. N. Ward in 1981. It is well-known that doubly even (4-divisible) binary codes can be used to construct stabilizer quantum codes. Triorthogonal binary codes and CSS-T pairs of binary codes were introduced to construct CSS-T quantum codes. In this paper, we show that 8-divisible (triply even) binary linear codes are triorthogonal codes and CSS-T pairs of codes can be obtained from 8-divisible codes directly. Infinitely many infinite families of2r2^{r}2r-divisible optimal binary codes are presented, for an arbitrarily large positive integerrrr. Seventeen doubly even (self-orthogonal) binary cyclic codes and five triply even binary cyclic codes with their minimum weights equal to the minimum weights of best-known linear codes are found. An infinite family of rate around12\frac {1}{2}21​explicit doubly even (self-orthogonal) binary cyclic codes with the lower boundnilog⁡ni\frac {n_{i}}{\log n_{i}}logni​ni​​on their minimum distances and the lower boundni2\sqrt {\frac {n_{i}}{2}}2ni​​​on their dual distances is constructed. This is much stronger than the main results in two previous papers published in IEEE Transactions on Information Theory, 2022 and 2024 by C. Ding, C. Tang, Z. Sun and C. Li. Many CSS-T quantum codes with new parameters are constructed. Many stabilizer quantum codes given in this paper have distances close to the best-known ones documented in Grassl’s database.
We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.