The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
DOI10.1007/S00025-024-02322-0MaRDI QIDQ6655413FDOQ6655413
Authors: Peter Boyvalenkov, Danila Cherkashin 
Publication date: 23 December 2024
Published in: Results in Mathematics (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Other designs, configurations (05B30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Mathematical programming (90Cxx) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Positive definite functions on spheres
- A fourth extremal even unimodular lattice of dimension 48
- Title not available (Why is that?)
- A numerical study of Siegel theta series of various degrees for the 48-dimensional even unimodular extremal lattices
- A survey on spherical designs and algebraic combinatorics on spheres
- Spherical codes and designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- The sphere packing problem in dimension \(24\)
- Title not available (Why is that?)
- New upper bounds for kissing numbers from semidefinite programming
- The kissing number in four dimensions
- Lower bounds for spherical designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey on the kissing numbers.
- Necessary conditions for existence of some designs in polynomial metric spaces
- The sphere packing problem in dimension 8
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Extremal polynomials for obtaining bounds for spherical codes and designs
- Title not available (Why is that?)
- Computing distance distributions of spherical designs
- Discrete energy on rectifiable sets
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
This page was built for publication: The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655413)
