Improvement of the Delsarte bound for -designs when it is not the best bound possible

DOI10.1023/A:1022544725332zbMATH Open1013.05022OpenAlexW1506287413MaRDI QIDQ1869830FDOQ1869830

Authors: 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

Recommendations

• Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• scientific article; zbMATH DE number 1498822
• Necessary conditions for existence of some designs in polynomial metric spaces
• Publication:4504299

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)

Cited In (7)

• Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
• Construction of spherical cubature formulas using lattices
• Linear programming bounds for covering radius of spherical designs
• A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs
• A survey on spherical designs and algebraic combinatorics on spheres
• Upper energy bounds for spherical designs of relatively small cardinalities
• On designs in compact metric spaces and a universal bound on their size

This page was built for publication: Improvement of the Delsarte bound for \(\tau\)-designs when it is not the best bound possible

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