Improved Delsarte bounds for spherical codes in small dimensions

DOI10.1016/j.jcta.2006.12.001zbMath1125.94049arXivmath/0501493OpenAlexW1971883905MaRDI QIDQ2642026

Florian Pfender

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0501493

zbMATH Keywords

kissing numberspherical codeslinear programming bound

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

A copositive formulation for the stability number of infinite graphs ⋮ Three-point bounds for energy minimization ⋮ On an SDP relaxation for kissing number ⋮ A short solution of the kissing number problem in dimension three ⋮ New upper bounds for kissing numbers from semidefinite programming ⋮ Bounds for codes by semidefinite programming ⋮ A survey on spherical designs and algebraic combinatorics on spheres

Cites Work

• The one-sided kissing number in four dimension
• Spherical codes and designs
• The kissing problem in three dimensions
• Spherical harmonics
• Das Problem der dreizehn Kugeln
• Positive definite functions on spheres
• An upper bound for the contact number in dimension 9
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Delsarte bounds for spherical codes in small dimensions