Julia Galstad, Gerald Hoehn
Published 2010-08-11Version 1
We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in detail. We classify self-dual L-codes up to length 10 and provide tables for these codes and their weight enumerators up to length 4. We also discuss extremal codes for which a nearly complete classification is obtained.
Comments: LaTeX, 29 pages, 7 tables
Design-theoretic analogies between codes, lattices, and vertex operator algebras
On triply even binary codes
Proofs of Two Conjectures On the Dimensions of Binary Codes
![QR code for arXiv:1008.1927 [math.CO]](http://oss.arxitics.com/images/favicon.svg)