We present some information and generator matrices for all inequivalent binary [38,19] self-dual codes. The classification method is presented in:

Stefka Bouyuklieva, Iliya Bouyukliev: " On the Classification of Binary Self-Dual Codes" CoRR abs/1106.5930 : (2011) http://arxiv.org/abs/1106.5930. See the paper here .

The generator matrices are saved in three different text files in the form presented in this paper You can download the files with generator matrices from here (file1) , here (file2) and here (file3) .

Information for the automorphism groups and the number of codewords with weights 2, 4, 6 and 8 is saved in a text file in the following format:

?19 38 2 1 63777066403145711616000
19 171 969 3876
?19 38 2 2 57590230240198656000
15 119 665 2836
?19 38 2 3 1175310821228544000
13 93 513 2316
?19 38 2 4 110750442769612800
12 80 437 2056
?19 38 2 5 421906448646144000
11 83 473 2068

This means
?k n p N |Aut|
A2 A4 A6 A8
where k is the dimension, n is the length of the codes, p is the characteristic of the field, Ai is the number of codewords of weight i in the corresponding code.
You can download this file from here . We use these parameters to check the mass formulas.

Summarized information for the automorphism groups of all inequivalent codes and for inequivalent codes with minimum distance 2, 4, 6 and 8 can be found here(All codes) , here (codes with d=2) , here (codes with d=4) , here (codes with d=6) , here (codes with d=8) .

Summarized information for the number of codewords with weight 2, 4, 6 and 8 for all inequivalent codes and for inequivalent codes with minimum distance 2, 4, 6 and 8 can be found here(All codes) , here (codes with d=2) , here (codes with d=4) , here (codes with d=6) , here (codes with d=8) .

Back