On linear programming bounds for spherical codes and designs

Details On linear programming bounds for spherical codes and designs On linear programming bounds for spherical codes and designs

2002-03-06

arxiv.org/abs/math/0203059v1

Mathematics

Combinatorics

Scientific paper

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 k^{n-1}.

Affiliated with

Also associated with

No associations

Rating

On linear programming bounds for spherical codes and designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On linear programming bounds for spherical codes and designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On linear programming bounds for spherical codes and designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583478