Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
From MaRDI portal
Publication:1292857
DOI10.1016/S0012-365X(99)90109-7zbMath0929.05097OpenAlexW3121614802MaRDI QIDQ1292857
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal polynomials used in bounds of code volume
- Designs as maximum codes in polynomial metric spaces
- On t-designs
- Association schemes and t-designs in regular semilattices
- Bilinear forms over a finite field, with applications to coding theory
- Discrete quadrature and bounds on t-designs
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Hahn Polynomials, Discrete Harmonics, andt-Designs
This page was built for publication: Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
