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 (4)

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 ⋮ Unnamed Item

Cites Work

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

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