Lee Polynomials of Codes and Theta Functions of Lattices

Maher, David P.

Canadian journal of mathematics, Tome 30 (1978) no. 4, pp. 738-747

Résumé

Several authors [2; 3; 10; 12] have noticed the similarities between the theory of codes and the theory of Euclidean lattices. It is interesting to compare the two theories since they share a common problem, viz. the sphere packing problem. In the theory of codes one would like to find a code over Fp, i.e. a subspace of Fp n, such that non-intersecting spheres with respect to a given metric, centered at the code vectors, pack Fp n densely.

Détail

DOI : 10.4153/CJM-1978-063-3

Bibliographie

[1] 1. Berlekamp, E. R., Algebraic coding theory (McGraw-Hill, N.Y., 1968). Google Scholar

[2] 2. M., Broué, Codes correcteurs d'erreurs auto-orthogonaux sur le corps a deux elements et formes quadratiques entières définies positives a discriminant + 1 , Comptes Rendus des Journées Mathématiques de la Société Math, de France, Univ. Sci. Tech. Languedoc (Montpellier, 1974), 71–108. Google Scholar

[3] 3. M., Broué and Enguehard, M., Polynômes des poids de certains codes et fonctions thêta de certains réseaux, Ann. Scient. Ec. Norm. Sup. 5 (1972), 157–181. Google Scholar

[4] 4. Conway, J. H., A group of order 8,315,553,613,086,720,000, Bull. London Math. Soc. 1 (1969), 79–88. Google Scholar

5. Invent. Math. 7 (1969), 137–142. Google Scholar

[6] 6. Gleason, A. M., Weight polynomials of self-dual codes and the MacWilliams identities, Actes Congres Internl. de Mathématique 3, 1970 (Gauthier-Villars, Paris (1971), 211–215. Google Scholar

[7] 7. Gunning, R. C., Lectures on modular forms (Princeton Univ. Press, 1962). Google Scholar

[8] 8. Kitaoka, Y., On the relation between the positive definite quadratic forms with the same representation numbers, Proc. Japan Acad. Ifl (1971). Google Scholar

[9] 9. Leech, J., Notes on sphere packings, Can. J. Math. 19 (1967), 251–267. Google Scholar

[10] 10. Leech, J. and Sloane, N. J. A., Sphere packings and error-correcting codes, Can. J. Math. 23 (1971), 718–745. Google Scholar

[11] 11. MacWilliams, F. J., Mallows, C. L., and Sloane, N. J. A., Generalizations of Gleason s theorem on weight enumerators of self-dual codes, IEEE Trans. Info. Theory 18 (1972), 794–805. Google Scholar

[12] 12. Mallows, C. L., Odlyzko, A. M., and Sloane, N. J. A., Upperbounds for modular forms, lattices, and codes, J. Algebra 36 (1975), 68–76. Google Scholar

[13a] 13a. Mallows, C. L. and Sloane, N. J. A., On the invariants of a linear group of order 336, Proc. Camb. Phil. Soc. 74 (1973), 435–440. Google Scholar

[13b] 13b. Mallows, C. L. and Sloane, N. J. A., An upper bound for self-dual codes, Information and Control 22 (1973), 188–200. Google Scholar

[14] 14. Maher, D. P., Self-orthogonal codes and modular forms, Ph.D. Thesis, Lehigh University, Bethlehem, Pa., 1976. Google Scholar

[15] 15. Ogg, A., Modular forms and dirichlet series (W. A. Benjamin, Inc., N.Y., 1969). Google Scholar

[16] 16. Pless, V., A classification of self-orthogonal codes overGFifl), Discrete Math. 3 (1972), 209–246. Google Scholar

[17] 17. Serre, J. P., A course in arithmetic (Springer-Verlag, New York, 1970). Google Scholar

[18] 18. Shimura, G., Introduction to the arithmetic theory of automorphic functions (Princeton University Press, Princeton, N.J., 1971). Google Scholar

[19] 19. Sloane, N. J. A., Codes over GF(4) and complex lattices, Algebra, J., to appear. Google Scholar

[20] 20. Tannery, J. and Moik, J., Elements de la théorie des fonctions elliptiques, t.2 (Gauthier-Villars, Paris 1898). Google Scholar