  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.
