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

On binary constructions of quantum codes

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

Published Dec 22, 1998• 0 citations
arXivHTMLPDF

Abstract

Using the notion of generalized weight 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.
DOI
10.48550/arxiv.quant-ph/9812065

Related papers

On binary constructions of quantum codes

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

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.

IEEE Transactions on Information Theory•Jan 1, 1999•67 citations

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

Generalization of Steane's Enlargement Construction of Quantum Codes and Applications

San Ling, Jinquan Luo, Chaoping Xing

We generalize Steane’s enlargement construction of binary quantum codes to q-ary quantum codes. We then apply this result to BCH codes and the study of asymptotic bounds, and obtain improvements to the quantum BCH codes constructed by Aly and Klappenecker and the quantum asymptotic bounds from algebraic geometry codes obtained by Feng, Ling and Xing.

IEEE Transactions on Information Theory•Jul 21, 2010•63 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•4 citations

Constructions of new families of nonbinary quantum codes

Giuliano G. La Guardia

Three code constructions generating new families of good nonbinary quantum codes are presented in this paper. The first two ones are derived from Hermitian self-orthogonal non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes. The third one is derived from $q$-ary ($q\ensuremath{\ne}2$ is a prime power) Steane's enlargement of Calderbank-Shor-Steane codes applied to Euclidean self-orthogonal non-narrow-sense BCH codes. The quantum nonbinary BCH codes presented here have parameters better than the ones available in the literature.

Physical Review A•Oct 28, 2009•102 citations
Three code constructions generating new families of good nonbinary quantum codes are presented in this paper. The first two ones are derived from Hermitian self-orthogonal non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes. The third one is derived from qqq-ary ($q\ensuremath{\ne}2$ is a prime power) Steane's enlargement of Calderbank-Shor-Steane codes applied to Euclidean self-orthogonal non-narrow-sense BCH codes. The quantum nonbinary BCH codes presented here have parameters better than the ones available in the literature.