A. Ashikhmin and A. Barg, Binomial moments of the distance distribution: bounds and applications, IEEE Transactions on Information Theory, vol.45, issue.2, pp.438-452, 1999.
DOI : 10.1109/18.748994

A. Ashikhmin, A. Barg, and S. Litsyn, Estimates of the Distance Distribution of Codes and Designs, Electronic Notes in Discrete Mathematics, vol.6, pp.1050-1061, 2001.
DOI : 10.1016/S1571-0653(04)00152-0

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, Universal Lower Bounds for Potential Energy of Spherical Codes, Constructive Approximation, vol.16, issue.3
DOI : 10.1007/s00365-016-9327-5

P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, and M. Stoyanova, Universal upper and lower bounds on energy of spherical designs

H. Cohn and A. Kumar, Universally optimal distribution of points on spheres, J. of AMS, vol.20, issue.1, pp.99-148, 2007.

H. Cohn and Y. Zhao, Energy-Minimizing Error-Correcting Codes, IEEE Transactions on Information Theory, vol.60, issue.12
DOI : 10.1109/TIT.2014.2359201

P. Delsarte and V. I. Levenshtein, Association schemes and coding theory, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2477-2504, 1998.
DOI : 10.1109/18.720545

V. I. Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Applicandae Mathematicae, vol.55, issue.3, pp.1-82, 1992.
DOI : 10.1007/BF00053379

V. I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Transactions on Information Theory, vol.41, issue.5, pp.1303-1321, 1995.
DOI : 10.1109/18.412678

V. I. Levenshtein, Universal bounds for codes and designs, Handbook of Coding Theory, pp.499-648, 1998.

R. J. Mcelliece, The Theory of Information and Coding, 1977.

C. R. Rao, Factorial Experiments Derivable from Combinatorial Arrangements of Arrays, Supplement to the Journal of the Royal Statistical Society, vol.9, issue.1, pp.128-139, 1947.
DOI : 10.2307/2983576