“…For extremal singly even self-dual [64, 32, 12] codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist, j, supp(x) and (k, β) are list in Table 2. Hence, we have the following: (0000010101111101) (0010011010111011) 0 C 64, 3 (0000011001101111) (0010110101011011) 0 C 64, 4 (0000000001011111) (0001001100101011) 8 C 64, 5 (0000000010101111) (0011011011110111) 8 C 64, 6 (0000000011010111) (0000100110011011) 8 C 64, 7 (0000000011010111) (0000101100010111) 8 C 64, 8 (0000000011010111) (0011101110101111) 8 C 64, 9 (0000000110111111) (0101101111111111) 8 C 64, 10 (0000001001011101) (0001000101011011) 8 C 64, 11 (0000001100011111) (0010101011011111) 8 C 64, 12 (0000001100011111) (0010111011011011) 8 C 64, 13 (0000001100111011) (0001101011101111) 8 C 64, 14 (0000001101111111) (0011101111011111) 8 C 64, 15 (0000010000111101) (0010111011011111) 8 C 64, 16 (0000010001011111) (0001110101101111) 8 C 64, 17 (0000010110111011) (0001101110001111) 8 C 64, 18 (0000000100011111) Now we consider the extremal doubly even self-dual neighbors of C 64,i (i = 1, 2, 3). Since the shadow has minimum weight 12, the two doubly even self-dual neighbors C 1 64,i and C 2 64,i are extremal doubly even self-dual [64, 32, 12] codes with covering radius 12 (see [4]).…”