Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible

DOI10.1023/A:1022544725332zbMath1013.05022OpenAlexW1506287413MaRDI QIDQ1869830

Svetla Nikova, Ventzislav Nikov

Publication date: 28 April 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022544725332

zbMATH Keywords

Delsarte bound\(\tau\)-designspolynomial metric spaces

Mathematics Subject Classification ID

Other designs, configurations (05B30) Applications of design theory to circuits and networks (94C30) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items

Construction of spherical cubature formulas using lattices ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs ⋮ Linear programming bounds for covering radius of spherical designs ⋮ A survey on spherical designs and algebraic combinatorics on spheres