New upper bounds for kissing numbers from semidefinite programming

@article{Bachoc2006NewUB,
  title={New upper bounds for kissing numbers from semidefinite programming},
  author={C. Bachoc and F. Vallentin},
  journal={Theoretical Computer Science},
  year={2006}
}
  • C. Bachoc, F. Vallentin
  • Published 2006
  • Mathematics
  • Theoretical Computer Science
  • Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases . 

    Tables from this paper.

    Semidefinite programming bounds for spherical codes
    4
    Bounds for codes by semidefinite programming
    12
    Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
    25
    SEMIDEFINITE PROGRAMMING BOUNDS FOR KISSING NUMBERS
    Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
    13
    An extension the semidefinite programming bound for spherical codes
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 54 REFERENCES
    Improved Delsarte bounds for spherical codes in small dimensions
    13
    Semidefinite programming relaxations for semialgebraic problems
    1384
    Improved Delsarte bounds via extension of the function space
    6
    New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions
    143
    Sphere packings, I
    • T. Hales
    • Mathematics, Computer Science
    • 1997
    1367
    The kissing number in four dimensions
    116
    Sphere Packings, Lattices and Groups
    3022