CoChat

Association schemes and coding theory

Delsarte, P., Levenshtein, V.I. · 1998 · IEEE Transactions on Information Theory
Cited by 219

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

Abstract

This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense). It is mainly concerned with a class of subjects that involve the central notion of the distance distribution of a code. Special emphasis is put on the linear programming method, inspired by the MacWilliams transform. This produces upper bounds for the size of a code with a given minimum distance, and lower bounds for the size of a design with a given strength. The most specific results are obtained in the case where the underlying association scheme satisfies certain well-defined "polynomial properties;" this leads one into the realm of orthogonal polynomial theory. In particular, some "universal bounds" are derived for codes and designs in polynomial type association schemes. Throughout the paper, the main concepts, methods, and results are illustrated by two examples that are of major significance in classical coding theory, namely, the Hamming scheme and the Johnson scheme. Other topics that receive special attention are spherical codes and designs, and additive codes in translation schemes, including Z/sub 4/-additive binary codes.

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

Cites

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

  • Algebraic Graph Theory

    Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940

  • Two-point homogeneous spaces

    Wang, H.-C. (1952) · The Annals of Mathematics · doi:10.2307/1969427 · Cited by 228 · cited 2×

    “We call distance-transitive (or two-point homogeneous [130]) a connected compact metric space with the distance function and the isometry group , if for any the equality implies the existence of some such that and As an example of a distance-transitive space we mention the unit Euclidean sphere in…”
    Background

Show all 2 references

Metadata

Authors
Delsarte, P., & Levenshtein, V. I.
Venue
IEEE Transactions on Information Theory
Published
1998
Volume
44
Issue
6
Pages
2477-2504
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2101520088
Cited by
219
References
2
FWCI
3.50
Type
journal article
Language
en
Open access
closed

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: Association schemes and coding theory. https://app.cochat.ai/papers/10.1109/18.720545
The paper
Delsarte, P., & Levenshtein, V. I. (1998). Association schemes and coding theory. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.720545

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.