Computing distance distributions of spherical designs

DOI10.1016/0024-3795(95)00153-IzbMath0832.05021WikidataQ127526551 ScholiaQ127526551MaRDI QIDQ1899412

P. G. Boyvalenkov

Publication date: 20 February 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

uniquenessisometryspherical designsdistance distributionscodes

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (8)

Properties of certain multi-angle tight frames in \(\mathbb{R}^d\) ⋮ Spherical designs and modular forms of the \(D_4\) lattice ⋮ On maximal antipodal spherical codes with few distances ⋮ Linear Programming Bounds for Spherical (k,k)-Designs ⋮ The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 ⋮ Unnamed Item ⋮ Uniqueness of the 120-point spherical 11-design in four dimensions ⋮ Min-max polarization for certain classes of sharp configurations on the sphere

Cites Work

• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• Tight spherical designs. I
• Equiangular lines
• Tight Spherical Disigns, II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing distance distributions of spherical designs