Fetching the paper…
Reading the bibliography…
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code.
K. Schütte, B.L. van der Waerden, Auf welcher Kugel haben 5,6,7,8 oder 9 Punkte mit Mindestabstand eins Platz?
1951
Earlier work this paper cites.
P. Delsarte, J.M. Goethals, J.J. Seidel, Spherical codes and designs
1977
Earlier work this paper cites.
P.J. Cameron, J.M. Goethals, J.J. Seidel, Strongly regular graphs having strongly regular subconstituents
1978
Earlier work this paper cites.
G.A. Kabatiansky, V.I. Levenshtein, Bounds for packings on a sphere and in space
1978
Earlier work this paper cites.
E. Bannai, N.J.A. Sloane, Uniqueness of certain spherical codes
1981
Earlier work this paper cites.
E. Bannai, T. Ito, Algebraic combinatorics I: Association schemes , Benjamin/Cummings, Menlo Park, California, 1984
1984
Earlier work this paper cites.
J.H. Conway, N.J.A. Sloane, Sphere packings, lattices and groups
1988
Earlier work this paper cites.
A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-regular graphs , Springer Verlag, 1989
1989
Cited alongside, same era.
H.T. Croft, K.J. Falconer, R.K. Guy, Unsolved problems in geometry
1991
Cited alongside, same era.
V.I. Levenshtein, Designs as maximum codes in polynomial metric spaces
1992
Cited alongside, same era.
J. de Loera, B. Sturmfels, R.A. Thomas, Gröbner bases and triangulations of the second hypersimplex
1995
Cited alongside, same era.
G.E. Andrews, R. Askey, R. Roy, Special functions
1999
Cited alongside, same era.
B. Borchers, CSDP, A C Library for Semidefinite Programming
1999
Cited alongside, same era.
H. Cuypers, A note on the tight spherical 7 7 -designs in ℝ 23 {\mathbb{R}}^{23} and 5 5 -designs in ℝ 7 {\mathbb{R}}^{7}
2005
Later among the works it cites.
C. Bachoc, F. Vallentin, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
2007
Closest in time.
B. Ballinger, G. Blekherman, H. Cohn, N. Giansiracusa, E. Kelly, A. Schürmann, Experimental study of energy-minimizing point configurations on spheres
2007
Closest in time.
H. Cohn, A. Kumar, Universally optimal distributions of points on spheres
2007
Closest in time.
H. Cohn, A. Kumar, Uniqueness of the ( 22,891 , 1 / 4 ) (22,891,1/4) spherical code
2007
Closest in time.
C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Closest in time.