### Table 9: Self-dual codes over GF(19)

2001

"... In PAGE 17: ...Table9 lists the orders |Aut(C)| of the automorphism groups and the weight enumerators W of the codes. From (2), the codes in Table 9 complete the classification of self-dual codes of length 4.... In PAGE 17: ...enumerators W of the codes. From (2), the codes in Table9 complete the classification of self-dual codes of length 4. Proposition 6.... ..."

### Table 3: Self-dual codes over GF(13) of lengths 2, 4 and 6

2001

"... In PAGE 7: ... Let C13,4,1 and C13,4,2 be the self-dual codes with generator matrices parenleftBigg 1 0 5 0 0 1 0 5 parenrightBigg and parenleftBigg 1 0 10 4 0 1 9 10 parenrightBigg , respectively. Table3 lists the orders |Aut(C)| of the automorphism groups and the weight enumerators W of these codes. From (2), the codes in Table 3 complete the classification of self-dual codes of lengths 2 and 4.... In PAGE 7: ... Table 3 lists the orders |Aut(C)| of the automorphism groups and the weight enumerators W of these codes. From (2), the codes in Table3 complete the classification of self-dual codes of lengths 2 and 4. Proposition 4.... ..."

### Table 6: Self-dual codes over GF(17) up to length 6

2001

"... In PAGE 12: ...Table6 lists the orders |Aut(C)| of the automorphism groups and the weight enumerators W of these codes. From (2), the codes in Table 6 complete the classification of self-dual codes of lengths 2 and 4.... In PAGE 12: ...enumerators W of these codes. From (2), the codes in Table6 complete the classification of self-dual codes of lengths 2 and 4. Similarly, the classification of length 6 has been done.... In PAGE 12: ... Similarly, the classification of length 6 has been done. The inequivalent codes are listed in Table6 . The mass formula (2) shows that the classification is complete.... ..."

### Table 2: Number of Indecomposable Self-Dual Additive Codes Over GF(4) by Distance

2005

"... In PAGE 2: ... We extend this sequence from n = 9 to n = 12 both for indecomposable and de- composable codes as shown in table 1. Table2 shows the number of inequivalent indecomposable codes by distance. The distance, d, of a self-dual additive code over GF(4), C, is the smallest weight (i.... ..."

Cited by 10

### Table 12: Self-dual codes over GF(29) of lengths up to 6

2001

"... In PAGE 20: ... Let C29,4,1 and C29,4,2 be the self-dual codes with generator matrices parenleftBigg 1 0 12 0 0 1 0 12 parenrightBigg and parenleftBigg 1 0 2 13 0 1 13 27 parenrightBigg , respectively. Table12 lists the orders of the automorphism groups |Aut(C)| and the weight enumerators W of the codes C. From (2), the codes in Table 12 complete the classification of self-dual codes of lengths 2 and 4.... In PAGE 20: ... Table 12 lists the orders of the automorphism groups |Aut(C)| and the weight enumerators W of the codes C. From (2), the codes in Table12 complete the classification of self-dual codes of lengths 2 and 4. Similarly, the classification of length 6 has been done.... In PAGE 20: ... The mass formula (2) shows that our classification is complete. The results for these codes are listed in Table12 . The generator matrices G29,6,i of C29,6,i are: G29,6,1 = 12, 0, 0, 0, 12, 0, 0, 0, 12, G29,6,2 = 13, 27, 0, 2, 13, 0, 0, 0, 12, G29,6,3 = 13, 22, 10, 2, 2, 22, 0, 2, 13, G29,6,4 = 20, 28, 27, 2, 9, 1, 1, 2, 9, G29,6,5 = 7, 12, 26, 6, 14, 12, 1, 6, 7, G29,6,6 = 20, 26, 24, 5, 9, 3, 3, 5, 9, G29,6,7 = 12, 15, 23, 12, 1, 12, 1, 11, 15, G29,6,8 = 7, 12, 3, 6, 5, 24, 1, 2, 9, G29,6,9 = 12, 22, 26, 12, 2, 24, 1, 2, 9, G29,6,10 = 12, 25, 10, 12, 18, 16, 1, 6, 7, G29,6,11 = 12, 20, 8, 12, 8, 20, 1, 12, 12.... ..."

### Table 4: Self-dual codes over GF(13) of length 8

2001

"... In PAGE 8: ...The automorphism group orders |Aut(C)| and the minimum weights d of the codes C13,8,i are listed in Table4 . The generator matrices G13,8,i of these codes have the following right halves: G13,8,1 = 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, G13,8,2 = 4, 10, 0, 0, 3, 4, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, G13,8,3 = 4, 5, 6, 0, 3, 2, 5, 0, 0, 3, 4, 0, 0, 0, 0, 5, G13,8,4 = 6, 1, 1, 0, 1, 6, 1, 0, 1, 1, 6, 0, 0, 0, 0, 5, G13,8,5 = 5, 10, 2, 0, 5, 2, 10, 0, 1, 5, 5, 0, 0, 0, 0, 5, G13,8,6 = 4, 10, 0, 0, 3, 4, 0, 0, 0, 0, 4, 10, 0, 0, 3, 4, G13,8,7 = 4, 5, 3, 1, 3, 2, 9, 3, 0, 3, 2, 5, 0, 0, 3, 4, G13,8,8 = 6, 1, 7, 11, 1, 6, 7, 11, 1, 1, 3, 1, 0, 0, 3, 4, G13,8,9 = 5, 10, 12, 4, 5, 2, 8, 7, 1, 5, 4, 10, 0, 0, 3, 4, G13,8,10 = 6, 12, 11, 7, 1, 6, 6, 11, 1, 0, 6, 12, 0, 1, 1, 6, G13,8,11 = 6, 9, 9, 10, 1, 8, 3, 9, 1, 3, 8, 9, 0, 1, 1, 6, G13,8,12 = 2, 6, 1, 6, 2, 4, 3, 10, 2, 3, 9, 10, 0, 4, 5, 6, G13,8,13 = 2, 6, 8, 5, 2, 5, 7, 8, 2, 2, 11, 0, 0, 5, 5, 12, G13,8,14 = 4, 0, 5, 6, 3, 11, 8, 0, 3, 3, 11, 4, 2, 5, 7, 8, G13,8,15 = 4, 1, 2, 2, 3, 9, 1, 8, 3, 5, 11, 0, 2, 3, 4, 10, G13,8,16 = 5, 8, 0, 1, 5, 5, 12, 0, 1, 0, 5, 8, 0, 1, 5, 5, G13,8,17 = 5, 9, 0, 6, 5, 3, 2, 0, 1, 5, 3, 9, 0, 1, 5, 5, G13,8,18 = 5, 6, 4, 0, 3, 6, 10, 7, 2, 2, 1, 9, 0, 1, 5, 5, G13,8,19 = 5, 2, 0, 10, 3, 4, 8, 12, 2, 2, 1, 9, 0, 1, 5, 5, G13,8,20 = 5, 9, 12, 10, 3, 1, 1, 12, 2, 2, 1, 9, 0, 2, 3, 5, G13,8,21 = 3, 4, 2, 10, 1, 11, 2, 4, 1, 2, 4, 2, 1, 1, 1, 3.... ..."

### Table 3: Binary Self-Dual Codes with n 28

"... In PAGE 4: ... The second statement follows similarly by taking the unique minimum weight vector with a vector of the second smallest weight. 2 Table3 gives d2 and d3 for all binary self-dual codes with n 28. Note that the code e8i2 has d1 = 2 and d2 = 6 which is higher than the bound d2 2d1 guarantees, so a self-dual code exists which exceeds the bound.... ..."

Cited by 1

### Table 2: Number of Indecomposable Self-Dual Additive Codes over GF(4) of Length n and Minimum Distance d

"... In PAGE 4: ... The values of in and tn can also be found as sequences A090899 and A094927 in The On-Line Encyclopedia of Integer Sequences [15]. Table2 lists the numbers of indecomposable codes by minimum distance, and Table 3 lists the numbers of type II codes by minimum distance. A database containing one representative from each LC orbit, with information about orbit size, weight distribution, etc.... ..."

### Table XVI: Highest Hamming distance (dH), Lee distance (dL) and Euclidean norm (Norm) of self-dual codes over Z4

### Table 7: Self-dual codes over GF(17) of length 8

2001

"... In PAGE 12: ... Next we give a classification of self-dual codes over GF(17) of length 8. The inequivalent codes are listed in Table7 . The mass formula (2) shows that the classification is complete.... ..."