A spherical code

DOI10.1070/RM1999V054N01ABEH000123MaRDI QIDQ4719741zbMATH OpenFDO

Authors Nikolay N. Andreev

Publication date 10 January 2000

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/RM1999V054N01ABEH000123

zbMATH Keywords

extremal arrangementslinear programmingspherical codes

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other types of codes (94B60)

Recommendations

• Publication:4865450
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• scientific article; zbMATH DE number 2154097
• Finding and investigating exact spherical codes
• Uniqueness of the 120-point spherical 11-design in four dimensions

Cited in

(15)

• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• Nonexistence of certain symmetric spherical codes
• A minimal design of order 11 on the 3-sphere
• Optimal measures for \(p\)-frame energies on spheres
• Mesh ratios for best-packing and limits of minimal energy configurations
• Universally optimal distribution of points on spheres
• scientific article; zbMATH DE number 2063857 (Why is no real title available?)
• The small stellated dodecahedron code and friends
• scientific article; zbMATH DE number 2154097 (Why is no real title available?)
• Packings in real projective spaces
• Three-point bounds for energy minimization
• Maximum independent sets of the 120-cell and other regular polyhedra
• TheD₄Root System Is Not Universally Optimal
• Bounds for spherical codes: the Levenshtein framework lifted
• A point balance algorithm for the spherical code problem

This page was built for publication: A spherical code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719741)