13,333 research outputs found
Designs and self-dual codes with long shadows
AbstractIn this paper we introduce the notion of s-extremal codes for self-dual binary codes and we relate this notion to the existence of 1-designs or 2-designs in these codes. We extend the classification of codes with long shadows of Elkies (Math. Res. Lett. 2(5) (1995) 643) to codes with minimum distance 6, for which we give partial classification
Conformal Designs based on Vertex Operator Algebras
We introduce the notion of a conformal design based on a vertex operator
algebra. This notation is a natural analog of the notion of block designs or
spherical designs when the elements of the design are based on self-orthogonal
binary codes or integral lattices, respectively. It is shown that the subspaces
of fixed degree of an extremal self-dual vertex operator algebra form conformal
11-, 7-, or 3-designs, generalizing similar results of Assmus-Mattson and
Venkov for extremal doubly-even codes and extremal even lattices. Other
examples are coming from group actions on vertex operator algebras, the case
studied first by Matsuo. The classification of conformal 6- and 8-designs is
investigated. Again, our results are analogous to similar results for codes and
lattices.Comment: 35 pages with 1 table, LaTe
\u3ci\u3es\u3c/i\u3e-Extremal Additive \u3cb\u3eF\u3csub\u3e4\u3c/sub\u3e\u3c/b\u3e Codes
Binary self-dual codes and additive self-dual codes over F4 have in common interesting properties, for example, Type I, Type II, shadows, etc. Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies\u27 study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths and (shadow) weight enumerators for which there exist s-extremal codes with 5 ≤ d ≤ 11 and give five s-extremal codes with d = 7. We construct four s-extremal codes of length n = 13 and minimum distance d = 5. We relate an s-extremal code of length 3d to another s-extremal code of that length, and produce extremal Type II codes from s-extremal codes
- …