E. R. Berlekamp, Algebraic coding theory, 1968.
DOI : 10.1142/9407

J. H. Conway and N. J. Sloane, Sphere packings, lattices and groups, p.290, 2003.

I. I. Dumer, Concatenated codes and their multilevel generalizations in Handbook of coding theory, pp.1911-1988, 1998.

D. Gardy and P. Solé, Saddle point techniques in asymptotic coding theory, Algebraic coding, pp.75-81, 1991.
DOI : 10.1007/BFb0034343

T. Ericson and V. Zinoviev, Codes on Euclidean spheres, North-Holland, 2001.

W. C. Huffman and V. Pless, Fundamentals of error-correcting codes, 2003.
DOI : 10.1017/CBO9780511807077

G. Lachaud and J. Stern, Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres, IEEE Transactions on Information Theory, vol.40, issue.4, pp.1140-1146, 1994.
DOI : 10.1109/18.335961

M. Y. Rosenbloom and M. A. Tsfasman, Multiplicative lattices in global fields, Inventiones Mathematicae, vol.23, issue.1, pp.687-696, 1990.
DOI : 10.1007/BF01231520

R. M. Roth and P. H. Siegel, Lee-metric BCH codes and their application to constrained and partial-response channels, IEEE Transactions on Information Theory, vol.40, issue.4, pp.1083-1096, 1994.
DOI : 10.1109/18.335966
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.755

J. A. Rush and N. J. Sloane, An improvement to Minkowski-Hlawka bound for packing superballs, Mathematika, pp.34-42, 1987.

J. A. Rush, A lower bound on packing density, Inventiones Mathematicae, vol.9, issue.3, pp.499-509, 1989.
DOI : 10.1007/BF01393834