Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications

DOI10.1016/S0012-365X(99)90109-7MaRDI QIDQ1292857zbMATH OpenOpenAlexFDO

Authors Vladimir Levenshtein

Publication date 25 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)90109-7

zbMATH Keywords

codesorthogonal arraysassociation schemesblock designsDelsarte bound

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Bounds on codes (94B65)

Recommendations

• On the equivalence of certain constant weight codes and combinatorial designs
• On symmetric and quasi-symmetric designs with the symmetric difference property and their codes
• Association schemes related to Delsarte-Goethals codes
• Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
• Symmetric block designs and optimal equidistant codes
• The equivalence of certain equidistant binary codes and symmetric BIBDS
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• A generalization of combinatorial designs and related codes
• Self-orthogonal codes from equitable partitions of association schemes
• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3158096 (Why is no real title available?)
• scientific article; zbMATH DE number 3818560 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 493090 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3048068 (Why is no real title available?)
• Association schemes and t-designs in regular semilattices
• Bilinear forms over a finite field, with applications to coding theory
• Designs as maximum codes in polynomial metric spaces
• Discrete quadrature and bounds on t-designs
• Extremal polynomials used in bounds of code volume
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On t-designs

Cited in

(3)

• Bounds for codes and designs in complex subspaces
• Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
• Association schemes related to Delsarte-Goethals codes

This page was built for publication: Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292857)