Finding and investigating exact spherical codes
| dc.creator | Wang, Jeffrey | |
| dc.date | 2008-05-06 | |
| dc.date | 2008-11-14 | |
| dc.date.accessioned | 2026-07-07T10:17:52Z | |
| dc.date.available | 2026-07-07T10:17:52Z | |
| dc.description | 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. | |
| dc.description | 17 pages | |
| dc.identifier | https://arxiv.org/abs/0805.0776 | |
| dc.identifier | http://arxiv.org/abs/0805.0776 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174001 | |
| dc.subject | Metric Geometry | |
| dc.title | Finding and investigating exact spherical codes | |
| dc.type | text |