New upper bounds for kissing numbers from semidefinite programming

Details New upper bounds for kissing numbers from semidefinite programming New upper bounds for kissing numbers from semidefinite programming

2006-08-16

arxiv.org/abs/math/0608426v4

J. Amer. Math. Soc. 21 (2008), 909-924

Mathematics

Metric Geometry

17 pages, (v4) references updated, accepted in Journal of the American Mathematical Society

Scientific paper

10.1090/S0894-0347-07-00589-9

Recently A. Schrijver derived new upper bounds for binary codes using
semidefinite programming. In this paper we adapt this approach to codes on the
unit sphere and we compute new upper bounds for the kissing number in several
dimensions. In particular our computations give the (known) values for the
cases n = 3, 4, 8, 24.

Affiliated with

Also associated with

No associations

Rating

New upper bounds for kissing numbers from semidefinite programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New upper bounds for kissing numbers from semidefinite programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New upper bounds for kissing numbers from semidefinite programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220573