Self-orthogonal designs and extremal doubly even codes (Q908922): Difference between revisions

In this paper a general method unifying the known constructions of binary self-orthogonal codes from designs is described. Exploring the concept of a self-orthogonal design, it has been generalized the construction of self-dual codes based on Hadamard designs to a construction using (0,1)-Hadamard matrices. This general construction can produce inequivalent codes from equivalent Hadamard matrices. As an application, it has been demonstrated that at least 79 (and perhaps many more) inequivalent extremal doubly even (40,20) codes are obtained from the Hadamard matrices of order 20. Many of these codes do not possess any automorphisms of an odd prime order, and there is at least one code with trivial automorphism group. This seems to be the first example of an extremal doubly even code without any nontrivial automorphisms.