On linear programming bounds for spherical codes and designs (Q701789)

In all code designs bounds play an important tale for their applications. In this paper, the author investigates universal bounds (lower and upper) on spherical codes and in extended spherical designs that could be obtained using Delsarte's linear programming techniques. A lower estimate for the upper bound on codes and an upper estimate for the lower bound on designs for the LP are given. For these, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is a least as large as the average of the best known upper and lower bounds. Also proven is that when 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)\).