Semidefinite programming bounds for spherical codes

被引：0
|
作者：
Bachoc, Christine [1 ]
Vallentin, Frank [1 ]
机构：
[1] Univ Bordeaux 1, IMB, 351 Cours Liberat, F-33405 Talence, France
来源：
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年
关键词：
D O I：
10.1109/ISIT.2007.4557148
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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.
引用
收藏
页码：1801 / +
页数：2
相关论文
共 50 条
12345