Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in R^4
From MaRDI portal
Publication:5942008
Recommendations
- scientific article; zbMATH DE number 1189034
- Upper bounds on the minimum distance of spherical codes
- On maximal antipodal spherical codes with few distances
- Bounds on equiangular lines and on related spherical codes
- scientific article; zbMATH DE number 1341365
- The Tietäväinen bound for spherical codes
- Asymptotic bounds for spherical codes
- scientific article; zbMATH DE number 1057745
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- Uniqueness of the \((22,891,1/4)\) spherical code
Cites work
- A note on optimal unimodular lattices
- Extremal polynomials for obtaining bounds for spherical codes and designs
- scientific article; zbMATH DE number 3155900 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 1259473 (Why is no real title available?)
- scientific article; zbMATH DE number 702183 (Why is no real title available?)
- scientific article; zbMATH DE number 837789 (Why is no real title available?)
- Minimum of the energy potential of a point system of charges
- Multiple packings and coverings of the sphere
- 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
- Spherical codes and designs
- The Closest Packing of Spherical Caps in n Dimensions
- The packing of three-dimensional spheres on the surface of a four-dimensional hypersphere
- Upper bounds on the minimum distance of spherical codes
Cited in
(5)- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- TheD4Root System Is Not Universally Optimal
- Bounds for spherical codes: the Levenshtein framework lifted
- Delsarte’s extremal problem and packing on locally compact Abelian groups
- On the existence of an extremal function for the Delsarte extremal problem
This page was built for publication: Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942008)