Finding and investigating exact spherical codes

DOI10.1080/10586458.2009.10128893MaRDI QIDQ3651324zbMATH OpenOpenAlexFDO

Authors Jeffrey H. Wang

Publication date 9 December 2009

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.0776, https://projecteuclid.org/euclid.em/1259158434

zbMATH Keywords

codeenergyminimizationspherical

Mathematics Subject Classification ID

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

Abstract: In this paper we present the results of computer searches using a variation of an energy minimization algorithm used by Kottwitz for finding good spherical codes. We prove that exact codes exist by representing the inner products between the vectors as algebraic numbers. For selected interesting cases, we include detailed discussion of the configurations. Of particular interest are the 20-point code in $mathbb{R}^6$ and the 24-point code in $mathbb{R}^7$, which are both the union of two cross polytopes in parallel hyperplanes. Finally, we catalogue all of the codes we have found.

Recommendations

• A point balance algorithm for the spherical code problem
• Indexes of spherical codes
• scientific article; zbMATH DE number 2154097
• Codes on Euclidean spheres
• Spherical codes generated by binary partitions of symmetric pointsets

Cited in

(21)

• The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space
• New lower bounds for contact numbers in small dimensions
• Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
• Constructive spherical codes near the Shannon bound
• Uniqueness of the \((22,891,1/4)\) spherical code
• Indexes of spherical codes
• A heuristic approach for designing cyclic group codes
• A computer search for \(N_{1L}\) configurations
• scientific article; zbMATH DE number 4047602 (Why is no real title available?)
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Nearest neighbor algorithm for spherical codes from the Leech lattice
• Decoding spherical codes for the Gaussian channel
• Uniqueness of Certain Spherical Codes
• scientific article; zbMATH DE number 1995821 (Why is no real title available?)
• scientific article; zbMATH DE number 2063857 (Why is no real title available?)
• scientific article; zbMATH DE number 1756459 (Why is no real title available?)
• A spherical code
• Asymptotic bounds for spherical codes
• Spherically Punctured Biorthogonal Codes
• Distance Verification for Classical and Quantum LDPC Codes
• A point balance algorithm for the spherical code problem

This page was built for publication: Finding and investigating exact spherical codes

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