| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654452 | European Journal of Combinatorics | 2009 | 13 Pages |
Abstract
In this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, J. Amer. Math. Soc. 21 (2008) 909–924] to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where, in particular, we get a new tight bound in dimension 8. Furthermore, we show how to use the SDP framework to get analytic bounds.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Christine Bachoc, Frank Vallentin,