On Linear Programming Bounds for Spherical Codes and Designs

Alex Samorodnitsky*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte's linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as the average of the best known upper and lower bounds. When the dimension n of the design is fixed, and the strength k goes to infinity, the LP bound on designs turns out, in conjunction with known lower bounds, to be proportional to kn-1.

Original languageAmerican English
Pages (from-to)385-394
Number of pages10
JournalDiscrete and Computational Geometry
Volume31
Issue number3
DOIs
StatePublished - Apr 2004

Fingerprint

Dive into the research topics of 'On Linear Programming Bounds for Spherical Codes and Designs'. Together they form a unique fingerprint.

Cite this