寻找和研究精确球码
Finding and investigating exact spherical codes
摘要:
在本文中,我们提出了计算机搜索的结果,使用的变化的能量最小化算法使用Kottwitz找到良好的球形代码。我们证明了精确码的存在表示的向量之间的内积为代数数。对于选定的有趣的情况下,我们包括详细的讨论的配置。特别令人感兴趣的是$\mathbb{R}^6$中的20点代码和$\mathbb{R}^7$中的24点代码,它们都是平行超平面中两个交叉多面体的并集。最后,我们将找到的所有代码进行分类。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。