New upper bounds for spherical codes and packings

DOI10.1007/s00208-023-02738-zMaRDI QIDQ6583556

Masoud Zargar, Naser Talebizadeh Sardari

Publication date: 6 August 2024

Published in: Mathematische Annalen (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical analysis (65-XX) Quantum theory (81-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sphere packing bounds via spherical codes
• Codes in spherical caps
• New upper bounds on sphere packings. I
• On the roots of the equation \(X_n = 0\).
• Sphere packing and quantum gravity
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• An upper bound on Jacobi polynomials
• A proof of the Kepler conjecture
• Orthogonal polynomials.
• Über die dichteste Kugellagerung
• High-dimensional sphere packing and the modular bootstrap
• Upper bounds for constant-weight codes
• The Packing of Equal Spheres
• New upper bounds for kissing numbers from semidefinite programming
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Upper bounds on the minimum distance of spherical codes
• Upper bounds for packings of spheres of several radii

Related Items (1)

Dual linear programming bounds for sphere packing via discrete reductions

This page was built for publication: New upper bounds for spherical codes and packings