volume 28, issue 1, P107-114 2002
DOI: 10.1007/s00454-001-0080-5
View full text
|
|
Share

Abstract: .5] maximizing M = |C| is commonly referred to as the kissing number problem. A well-known technique based on harmonic analysis and linear programming can be used to bound M. We consider a modification of the bounding procedure that is applicable to antipodal codes; that is, codes where x ∈ C ⇒ −x ∈ C. Such codes correspond to packings of lines in the unit sphere, and include all codes obtained as the collection of minimal vectors in a lattice. We obtain improvements in upper bounds for kissing numbers attain…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
10
0

Publication Types

Select...

Relationship

0
0

Authors

Journals