Some restrictions on weight enumerators of singly even self-dual codes
Masaaki Harada, Akihiro Munemasa · IEEE Transactions on Information Theory · 2006
In this correspondence, we give some restrictions on weight enumerators of singly even self-dual [n,n/2,d] codes whose shadows have minimum weight d/2. As a consequence, we determine the weight enumerators for which there is an extremal singly even self-dual [40,20,8] code and an optimal singly even self-dual [50,25,10] code