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

DOI10.1016/S0012-365X(99)90109-7zbMATH Open0929.05097OpenAlexW3121614802MaRDI QIDQ1292857FDOQ1292857

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Association schemes and t-designs in regular semilattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On t-designs
• Title not available (Why is that?)
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Extremal polynomials used in bounds of code volume
• Designs as maximum codes in polynomial metric spaces
• Discrete quadrature and bounds on t-designs
• Title not available (Why is that?)

Cited In (3)

• Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
• Bounds for codes and designs in complex subspaces
• 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)