New asymptotic bounds on the size of list codes on Euclidean sphere

Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings.