2-modular lattices from ternary codes. (Q1396433)

The present article is a ternary analogue to work by \textit{S. Dougherty}, \textit{P. Gaborit}, \textit{M. Harada} and \textit{P. Solé} [IEEE Trans. Inf. Theory 45, 32--45 (1999; Zbl 0947.94023)]. Gray images of self-dual codes over \(R:= \mathbb F_3 +v\mathbb F_3\) are used to characterize self-dual ternary codes with a fixed point free involution. \(R\) can be identified with the quotient \(\mathbb Z[\sqrt{-2}]/(3)\), and thus it is possible to identify a code \(C\) in \(R\) with its preimage \(A(C)\) in \(\mathbb Z[\sqrt{-2}]\). The following theorem is proved: If \(C\subseteq R^n\) is a self-dual code, then the lattice \(A(C)/\sqrt{3}\) is 2-modular. Its norm is equal to the minimum of 3 and \(l(C)/3\), where \(l(C)\) is the minimum length of the code \(C\). Furthermore, Gleason-type theorems for the symmetrized weight enumerators of Euclidean self-dual codes and the length weight enumerator of Hermitian self-dual codes are derived. The paper concludes with some examples: an optimal 2-modular lattice of norm 3 and dimension 18 and odd 2-modular lattices of norm 3 for dimensions \(2n\), \(8\leq n\leq 15\).