Title :
Semidefinite programming bounds for spherical codes
Author :
Bachoc, C. ; Vallentin, F.
Author_Institution :
IMB, Univ. Bordeaux I, Bordeaux
Abstract :
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite programming. With this method we improve the previous bounds for the kissing number in several dimensions, as well as other classical problems like Tammes´ problem.
Keywords :
binary codes; linear codes; mathematical programming; kissing number; semidefinite programming bounds; spherical codes; Algebra; Binary codes; Code standards; Extraterrestrial measurements; Galois fields; Harmonic analysis; Mathematical programming; Matrix decomposition; Polynomials; Upper bound;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557148
