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

IEEE Transactions on Information Theory

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

Hao Chen, Cong Yu, Yaqi Chen, Conghui Xie, Zhonghua Sun, Shixin Zhu

Published Aug 4, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/tit.2026.3719641

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 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

On quasi-cyclic codes

P. Heijnen, Henk van Tilborg, S. Weijs

Many binary quasi-cyclic codes have a better minimum distance than other known linear codes with the same parameters. We present 43 new quasi-cyclic codes, which improve on the parameters of previously found quasi-cyclic codes. Five of them even improve the lower bound on the minimum distance for linear codes. Furthermore we present a decoding algorithm for the binary quasi-cyclic codes of rate 1/m.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•5 citations

On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes

Carlos Galindo, Fernando Hernando

Abstract Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $$q^2$$ q 2 -ary linear codes. This result can be generalized to $$q^{2 m}$$ q 2 m -ary linear codes, $$m > 1$$ m > 1 . We give a result for easily obtaining quantum codes from that generalization. As a consequence we provide several new binary stabilizer quantum codes which are records according to Grassl (Bounds on the minimum distance of linear codes, http://www.codetables.de , 2020) and new q-ary ones, with $$q \ne 2$$ q ≠ 2 , improving others in the literature.

arXiv:2012.11998•Designs Codes and Cryptography•Mar 21, 2022•8 citations

Asymptotically Good CSS-T Codes and a New Construction of Triorthogonal Codes

Elena Berardini, Reza Dastbasteh, Josu Etxezarreta Martínez +2 more

We propose a new systematic construction of CSS-T codes from any given CSS code using a map ϕ. When ϕ is the identity map I, we retrieve the construction of hu2021mitigating and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes. We analyze the structure of the logical operators corresponding to certain non-Clifford gates supported by the quantum codes obtained from this construction (ϕ=I), concluding that they always result in the logical identity. An immediate application of these codes in dealing with coherent noise is discussed. We then develop a new doubling transformation for obtaining triorthogonal codes, which generalizes the doubling construction presented in jain2024. Our approach permits using self-orthogonal codes, instead of only doubly-even codes, as building blocks for triorthogonal codes. This broadens the range of codes available for magic state distillation.

arXiv:2412.08586•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•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
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.
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.
Abstract Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal q2q^2q2 q 2 -ary linear codes. This result can be generalized to q2mq^{2 m}q2m q 2 m -ary linear codes, m>1m > 1m>1 m > 1 . We give a result for easily obtaining quantum codes from that generalization. As a consequence we provide several new binary stabilizer quantum codes which are records according to Grassl (Bounds on the minimum distance of linear codes, http://www.codetables.de , 2020) and new q-ary ones, with q≠2q \ne 2q=2 q ≠ 2 , improving others in the literature.
We propose a new systematic construction of CSS-T codes from any given CSS code using a map ϕ. When ϕ is the identity map I, we retrieve the construction of hu2021mitigating and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes. We analyze the structure of the logical operators corresponding to certain non-Clifford gates supported by the quantum codes obtained from this construction (ϕ=I), concluding that they always result in the logical identity. An immediate application of these codes in dealing with coherent noise is discussed. We then develop a new doubling transformation for obtaining triorthogonal codes, which generalizes the doubling construction presented in jain2024. Our approach permits using self-orthogonal codes, instead of only doubly-even codes, as building blocks for triorthogonal codes. This broadens the range of codes available for magic state distillation.
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.