Abstract
The theory of modular forms is used to find various combinatorial properties of extremal doubly-even codes of length 48. This makes it possible to reduce the problem of classifying such codes to a computer-solvable problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North Holland, Amsterdam-New York-Oxford (1977).
J. H. Convery and N. J. A. Sloane, Sphere Packing, Lattices and Groups, Springer-Verlag (1988).
W. Huffman, “Automorphisms of Codes with applications to extremal doubly even codes of length 48,” IEE Trans. Inform. Theory,28, No. 3, 496–511 (1982).
B. B. Venkov, “Even unimodular extremal lattices,” Tr. Mat. Inst. Akad. Nauk SSSR,165, 43–48 (1984).
R. Delsarte, “Four fundamental parameters of a code and their combinatorial significance,” Inform. Control,23, No. 5, 407–438 (1973).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 175, pp. 24–29, 1989.
Rights and permissions
About this article
Cite this article
Venkov, B.B., Ivanov, D.M. Combinatorial properties of extremal doubly-even codes of length 48. J Math Sci 57, 3459–3462 (1991). https://doi.org/10.1007/BF01100113
Issue Date:
DOI: https://doi.org/10.1007/BF01100113