CoChat

Quantum shadow enumerators

Open access
Rains, E.M. · 1999 · IEEE Transactions on Information Theory
Cited by 97

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

In a previous paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-02, 1997) define two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams (1977) transform, and use them to give a linear-programming bound for quantum codes. We extend their work by introducing another enumerator, based on the classical theory of shadow codes, that tightens their bounds significantly. In particular, nearly all of the codes known to be optimal among additive quantum codes (codes derived from orthogonal geometry) can be shown to be optimal among all quantum codes. We also use the shadow machinery to extend a bound on additive codes to general codes, obtaining as a consequence that any code of length, can correct at most [(n+1)/6] errors.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/18.796376

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 7

  1. macwilliams, 1977, The Theory of Error-Correcting Codes
  2. 10.1109/18.651000 · DOI · Paper page
  3. 10.1109/18.681316 · DOI · Paper page
  4. 10.1103/PhysRevLett.78.1600 · DOI · Paper page
  5. 10.1109/18.651000 · DOI · Paper page
  6. 10.1109/18.59931 · DOI · Paper page
  7. 10.1109/18.681315 · DOI · Paper page

Cited by

See all 97

Metadata

Authors
Rains, E. M.
Venue
IEEE Transactions on Information Theory
Published
1999
Volume
45
Issue
7
Pages
2361-2366
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2117002761
Cited by
97
References
1
FWCI
5.29
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum shadow enumerators. https://app.cochat.ai/papers/10.1109/18.796376
The paper
Rains, E. M. (1999). Quantum shadow enumerators. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.796376

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.