Applications of coding theory to the construction of modular lattices

140Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study self-dual codes over certain finite rings which are quotients of quadratic imaginary fields or of totally definite quaternion fields over ℚ. A natural weight taking two different nonzero values is defined over these rings; using invariant theory, we give a basis for the space of invariants to which belongs the three variables weight enumerator of a self-dual code. A general bound for the weight of such codes is derived. We construct a number of extremal self-dual codes, which are the codes reaching this bound, and derive some extremal lattices of level l = 2, 3, 7 and minimum 4, 6, 8. © 1997 Academic Press.

Cite

CITATION STYLE

APA

Bachoc, C. (1997). Applications of coding theory to the construction of modular lattices. Journal of Combinatorial Theory. Series A, 78(1), 92–119. https://doi.org/10.1006/jcta.1996.2763

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free