Improved Delsarte bounds for spherical codes in small dimensions (Q2642026)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5180247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved Delsarte bounds for spherical codes in small dimensions |
scientific article; zbMATH DE number 5180247 |
Statements
Improved Delsarte bounds for spherical codes in small dimensions (English)
0 references
20 August 2007
0 references
A spherical \((n,N,\alpha)\) code is a set of \(N\) unit vectors in \(n\)-dimensional Euclidean space such that the pairwise angular distance between the vectors is at least \(\alpha\). The central questions are maximizing either \(N\) or \(\alpha\) while fixing the other two parameters. The well known technique used by Delsarte which established bounds for binary codes and association schemes was extended by Delsarte, Goethals and Seidel to the case of spherical codes. The author extends this linear programming method for spherical codes and examines the particular case corresponding to the kissing number problem. Specifically upper bounds are improved for kissing numbers. Recent work by Musin in dimensions three and four is cast in this setting.
0 references
spherical codes
0 references
linear programming bound
0 references
kissing number
0 references
0 references
0.9209208
0 references
0.91050476
0 references
0.9094125
0 references
0.9044322
0 references
0.8982074
0 references
0.8967936
0 references
0.89530504
0 references
