6 research outputs found
Some restrictions on weight enumerators of singly even self-dual codes II
In this note, we give some restrictions on the number of vectors of weight
in the shadow of a singly even self-dual code. This
eliminates some of the possible weight enumerators of singly even self-dual
codes for , , , and
.Comment: 16 page
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