Computing distance distributions of spherical designs
From MaRDI portal
Publication:1899412
DOI10.1016/0024-3795(95)00153-IzbMATH Open0832.05021WikidataQ127526551 ScholiaQ127526551MaRDI QIDQ1899412FDOQ1899412
Authors: Peter Boyvalenkov 
Publication date: 20 February 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spherical codes and designs
- Tight spherical designs. I
- Tight Spherical Disigns, II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equiangular lines
- Designs as maximum codes in polynomial metric spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Linear Programming Bounds for Spherical (k,k)-Designs
- Distancepreserving sampling method for construction of maximin distance designs in hyperspheres
- Title not available (Why is that?)
- Definitions for spherical designs
- On maximal antipodal spherical codes with few distances
- Properties of certain multi-angle tight frames in \(\mathbb{R}^d\)
- A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)
- Min-max polarization for certain classes of sharp configurations on the sphere
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Spherical designs and modular forms of the \(D_4\) lattice
- Uniqueness of the 120-point spherical 11-design in four dimensions
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)
