Extremal polynomials for obtaining bounds for spherical codes and designs

Discrete & Computational Geometry

Volumn 14, Issue 1, 1995, Pages 167-183

  Boyvalenkov, P ^a  

^a INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844516712     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/BF02570701     Document Type: Article

References (37)

1. Construction of spherical 4- and 5-designs
2. Construction of spherical t-designs
3. Spherical designs which are orbits of finite groups
4. Tight spherical designs, I
5. Tight spherical designs, II
6. Uniqueness of certain spherical codes
7. On the upper bounds for the kissing numbers
8. Nonexistence of certain symmetric spherical codes
9. On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
10. Small improvements for the upper bounds for the kissing numbers in dimensions 19, 21 and 23
11. Bounds for systems of lines, and Jacobi polynomials
12. Spherical codes and designs
13. Discrete quadrature and bounds on t-designs
14. New spherical 4-designs
15. Bounds for packings on a sphere and in space
16. On bounds for packings in n-dimensional Euclidean space
17. Bounds on the maximum cardinality of a code with bounded modules of the inner product
18. Bounds for packings in metric spaces and certain applications
19. Designs as maximum codes in polynomial metric spaces
20. A construction of spherical 2-designs
21. New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
22. The closest packing of spherical caps in n dimensions
23. Averaging sets: a generalization of mean values and spherical designs
24. On extremal polynomials used to estimate the size of codes