Optimality and uniqueness of the (4,10,1/6) spherical code
Langue
en
Article de revue
Ce document a été publié dans
Journal of Combinatorial Theory, Series A. 2009-01, vol. 116, p. 195-204
Elsevier
Résumé en anglais
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear programming bounds. However, this approach does not apply to the parameter (4,10,1/6). We use semidefinite programming bounds ...Lire la suite >