Improved Linear Programming Bounds for Antipodal Spherical Codes

@article{Anstreicher2002ImprovedLP,
  title={Improved Linear Programming Bounds for Antipodal Spherical Codes},
  author={Kurt M. Anstreicher},
  journal={Discrete & Computational Geometry},
  year={2002},
  volume={28},
  pages={107-114}
}
Let S ?1; 1). A nite set C = fx i g M i=1 < n is called a spherical S-code if kx i k = 1 for each i, and x T i x j 2 S, i 6 = j. For S = ?1; :5] maximizing M = jCj is commonly referred to as the kissing number problem. A well-known technique based on harmonic analysis and linear programming can be used to bound M. We consider a modiication of the bounding procedure that is applicable to antipodal codes; that is, codes where x 2 C) ?x 2 C. Such codes correspond to packings of lines in the unit… CONTINUE READING