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:quant-ph/9812065 · IEEE Transactions on Information Theory

On binary constructions of quantum codes

Gérard Cohen, S. Encheva, Simon N. Litsyn

Published Jan 1, 1999• 67 citations
arXivHTMLPDF

Abstract

We improve estimates on the parameters of quantum codes obtained by Steane's (see ibid., vol.45, no.7, p.2492-5, 1999) construction from binary codes. This yields several new families of quantum codes.
DOI
10.1109/18.796389

Related papers

not counting primitive codes). Quantum codes obtained from BCH codes with these values of are listed in Table II. Further good codes exist in the range for

V. Efficiency

We improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.

•Jan 1, 1999•0 citations

On binary constructions of quantum codes

Gérard Cohen, Sylvia B. Encheva, Simon N. Litsyn

Recently, Steane (1998) proposed an enlargement of the Calderbank-Shor-Steane construction. Here we further improve on the parameters obtained from his construction, present examples of new codes, and analyze asymptotical non-constructive bounds.

IEEE Information Theory Workshop (ITW)•Jan 20, 2003•3 citations

Binary construction of quantum codes

Ruihu Li, Xueliang Li

In this paper, we construct a large number of good quantum codes of minimum distances five and six by Steane’s Construction. Our methods involve the study of the check matrices of binary extended BCH-codes, together with puncturing and combining such matrices.

•Jan 1, 2006•3 citations

Optimal binary codes and binary construction of quantum codes

Weiliang Wang, Yangyu Fan, Ruihu Li

Frontiers of Computer Science•Oct 22, 2014•4 citations

Combinational Construction of Self-orthogonal Codes and Its Application

Jian Liu

Quantum error-correcting codes protect quantum information against undesirable noise in quantum computation and quantum communication.It is one of important problems that constructing very good quantum codes.There are two methods that use binary codes to construct quantum codes,one is CSS construction,another is Steane construction.These two methods are all based on the construction of binary self-orthogonal codes.Combinational construction of binary self-orthogonal codes is investigated in this paper.From known codes chains of binary self-orthogonal codes and their dual codes chains with given dual distance,new binary self-orthogonal codes of dual distance three,four,five and six are constructed.Based on these results,for each satisfying,S-chains with parameters and are constructed.According to Steane's construction,many very good quantum codes of distance five and six are constructed by the obtained S-chains,some of these quantum codes are new and some of these quantum codes have improved parameters than previously known codes.

Journal of Air Force Engineering University•Jan 1, 2009•0 citations

Quasi-cyclic Hermitian construction of binary quantum codes

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

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good quantum codes. 30 new binary quantum codes with good parameters improving the best-known lower bounds on minimum distance in Grassl's code tables \cite{Grassl:codetables} are constructed.

arXiv:2210.04487•Oct 10, 2022•2 citations
Quantum error-correcting codes protect quantum information against undesirable noise in quantum computation and quantum communication.It is one of important problems that constructing very good quantum codes.There are two methods that use binary codes to construct quantum codes,one is CSS construction,another is Steane construction.These two methods are all based on the construction of binary self-orthogonal codes.Combinational construction of binary self-orthogonal codes is investigated in this paper.From known codes chains of binary self-orthogonal codes and their dual codes chains with given dual distance,new binary self-orthogonal codes of dual distance three,four,five and six are constructed.Based on these results,for each satisfying,S-chains with parameters and are constructed.According to Steane's construction,many very good quantum codes of distance five and six are constructed by the obtained S-chains,some of these quantum codes are new and some of these quantum codes have improved parameters than previously known codes.