For many extremal configurations of points on a sphere, the linear programming approach can be used to show their optimality. In this paper we establish the general framework for showing stability of such configurations and use this framework to prove the stability of the two spherical codes formed by minimal vectors of the lattice $E_8$ and of the Leech lattice.

翻译：对于一个球体上的许多极末端点配置,线性编程方法可以用来显示其最佳性。 在本文件中,我们建立了显示这种配置稳定性的总框架,并利用这个框架来证明由最起码的拉蒂埃8美元和利奇拉蒂构成的两种球形码的稳定性。