Computing distance distributions of spherical designs
From MaRDI portal
(Redirected from Publication:1899412)
Recommendations
Cites work
- scientific article; zbMATH DE number 4191741 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3503264 (Why is no real title available?)
- scientific article; zbMATH DE number 3299994 (Why is no real title available?)
- Designs as maximum codes in polynomial metric spaces
- Equiangular lines
- Spherical codes and designs
- Tight Spherical Disigns, II
- Tight spherical designs. I
Cited in
(11)- On maximal antipodal spherical codes with few distances
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Linear Programming Bounds for Spherical (k,k)-Designs
- Spherical designs and modular forms of the \(D_4\) lattice
- Properties of certain multi-angle tight frames in \(\mathbb{R}^d\)
- Uniqueness of the 120-point spherical 11-design in four dimensions
- scientific article; zbMATH DE number 1341365 (Why is no real title available?)
- Distancepreserving sampling method for construction of maximin distance designs in hyperspheres
- Min-max polarization for certain classes of sharp configurations on the sphere
- Definitions for spherical designs
- A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)
This page was built for publication: Computing distance distributions of spherical designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899412)
