On extremal additive codes of length to
Christine Bachoc, Philippe Gaborit (2000)
Journal de théorie des nombres de Bordeaux
Similarity:
In this paper we consider the extremal even self-dual -additive codes. We give a complete classification for length . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length and we show that in length such a code is equivalent to the unique -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal -modular lattices.