Extremal polynomials for obtaining bounds for spherical codes and designs

DOI10.1007/BF02570701zbMath0836.94024MaRDI QIDQ1895969

P. G. Boyvalenkov

Publication date: 8 May 1996

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131397

zbMATH Keywords

boundsextremal polynomialsspherical designsspherical codeopen problems

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Related Items (8)

On lower bounds on the size of designs in compact symmetric spaces of rank 1 ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) ⋮ Linear programming bounds for covering radius of spherical designs ⋮ Lower bounds for projective designs, cubature formulas and related isometric embeddings ⋮ Linear programming bounds for codes in infinite projective spaces ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Bounds for spherical codes: The Levenshtein framework lifted

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical t-designs which are orbits of finite groups
• A construction of spherical 2-design
• Averaging sets: A generalization of mean values and spherical designs
• Extremal polynomials used in bounds of code volume
• Construction of spherical 4- and 5-designs
• Construction of spherical \(t\)-designs
• New spherical 4-designs
• Designs as maximum codes in polynomial metric spaces
• Nonexistence of certain symmetric spherical codes
• Spherical codes and designs
• Tight spherical designs. I
• Discrete quadrature and bounds on t-designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
• Tight Spherical Disigns, II
• Geometry of moment spaces
• The Closest Packing of Spherical Caps in n Dimensions

This page was built for publication: Extremal polynomials for obtaining bounds for spherical codes and designs