| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777296 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
Using linear programming techniques we derive bounds for antipodal spherical codes with few possible different distances. The possibilities for attaining our bounds are investigated and Lloyd-type theorems are proved.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Boyvalenkov, Konstantin Delchev,