Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)

DOI10.1007/BF02676721zbMath1018.94039MaRDI QIDQ5942008

A. G. Babenko, Vitalii Arestov

Publication date: 18 February 2003

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Gegenbauer polynomialsangular distanceChebyshev polynomials of the second kindDelsarte functionkissing numbersspherical codespherical packings

Mathematics Subject Classification ID

Bounds on codes (94B65) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items

Delsarte’s extremal problem and packing on locally compact Abelian groups, The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space, Bounds for spherical codes: The Levenshtein framework lifted

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical codes and designs
• New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
• A note on optimal unimodular lattices
• On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers
• Extremal polynomials for obtaining bounds for spherical codes and designs
• Multiple packings and coverings of the sphere
• The packing of three-dimensional spheres on the surface of a four-dimensional hypersphere
• Upper bounds on the minimum distance of spherical codes
• The Closest Packing of Spherical Caps in n Dimensions