Classification of Hadamard matrices of order 44 with automorphisms of order 7

The Hadamard matrices of order 44 possessing automorphisms of order 7 are classified. The number of their equivalence classes is 384. The order of their full automorphism group is calculated. These Hadamard matrices yield 1683 nonisomorphic 3-(44,22,10) designs, 57932 nonisomorphic 2-(43,21,10) designs, and two inequivalent extremal binary self-dual doubly even codes of length 88 (one of them being new).     

Singly-Even Self-Dual Codes of Length 40

All singly-even self-dual [40,20,8] binary codes which have an automorphism of prime order are obtained up to equivalence. There are two inequivalent codes with an automorphism of order 7 and 37 inequivalent codes with an automorphism of order 5. These codes have highest possible minimal distance and some of them are the first known codes with weight enumerators prescribed by Conway and Sloane.     

Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs

Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes.     

The [52, 26, 10] Binary Self-Dual Codes with an Automorphism of Order 7

All [52, 26, 10] binary self-dual codes with an automorphism of order 7 are enumerated. Up to equivalence, there are 499 such codes. They have two possible weight enumerators, one of which has not previously arisen.     

Symplectic semifield planes and -linear codes

There are lovely connections between certain characteristic 2 semifields and their associated translation planes and orthogonal spreads on the one hand, and -linear Kerdock and Preparata codes on the other. These inter-relationships lead to the construction of large numbers of objects of each type. In the geometric context we construct and study large numbers of nonisomorphic affine planes coordinatized by semifields; or, equivalently, large numbers of non-isotopic semifields: their numbers are not bounded above by any polynomial in the order of the plane. In the coding theory context we construct and study large numbers of -linear Kerdock and Preparata codes. All of these are obtained using large numbers of orthogonal spreads of orthogonal spaces of maximal Witt index over finite fields of characteristic 2.

We also obtain large numbers of ``boring' affine planes in the sense that the full collineation group fixes the line at infinity pointwise, as well as large numbers of Kerdock codes ``boring' in the sense that each has as small an automorphism group as possible.

The connection with affine planes is a crucial tool used to prove inequivalence theorems concerning the orthogonal spreads and associated codes, and also to determine their full automorphism groups.

     

New optimal [52, 26, 10] self-dual codes

We classify up to equivalence all optimal binary self-dual [52, 26, 10] codes having an automorphism of order 3 with 10 fixed points. We achieve this using a method for constructing self-dual codes via an automorphism of odd prime order. We study also codes with an automorphism of order 3 with 4 fixed points. Some of the constructed codes have new values β = 8, 9, and 12 for the parameter in their weight enumerator.     

Erratum to “The extremal codes of length 42 with automorphism of order 7” [Discrete Math. 190 (1998) 201–213]

This note corrects a mistake in the previous paper where some of the codes are missing and others are repeated. All [42, 21, 8] binary self-dual with an automorphism of order 7 are enumerated. Up to equivalence their number is 29.     

The binary extremal self-dual codes of lengths 38 and 40

We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.     

Hamming spaces and maximal self dual codes over GF(q), q=ODD

The group of automorphisms of a Hamming space is determined. Self dual codes over odd characteristic finite field with respect to bilinear forms are treated. Under the subgroup of the monomial group preserving the inner product, we classify the maximal self dual codes overGF(5) with respect to the inner product of dimension ≤8. The Hamming Weight distribution and the order of the automorphism of the code are given. Partially supported by NSERC A8460 and Scarborough College.     

Fixed points of automorphisms of real algebraic curves

We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of an automorphism and the maximum order of an abelian group of automorphisms of a real curve. We also bound the full group of automorphisms of a real hyperelliptic curve. Work supported by the European Community’s Human Potential Programme under contract HPRN-CT-2001-00271, RAAG.     

Binary self-dual codes with automorphisms of order 23

The only example of a binary doubly-even self-dual [120,60,20] code was found in 2005 by Gaborit et al. (IEEE Trans Inform theory 51, 402–407 2005). In this work we present 25 new binary doubly-even self-dual [120,60,20] codes having an automorphism of order 23. Moreover we list 7 self-dual [116,58,18] codes, 30 singly-even self-dual [96,48,16] codes and 20 extremal self-dual [92,46,16] codes. All codes are new and present different weight enumerators.      

Constructing Covering Codes with Given Automorphisms

Let K(n,r) denote the minimum cardinality of a binary covering code of length n and covering radius r. Constructions of covering codes give upper bounds on K(n,r). It is here shown how computer searches for covering codes can be sped up by requiring that the code has a given (not necessarily full) automorphism group. Tabu search is used to find orbits of words that lead to a covering. In particular, a code D found which proves K(13,1) 704, a new record. A direct construction of D given, and its full automorphism group is shown to be the general linear group GL(3,3). It is proved that D is a perfect dominating set (each word not in D is covered by exactly one word in D) and is a counterexample to the recent Uniformity Conjecture of Weichsel.     

On binary self-dual codes of lengths 60, 62, 64 and 66 having an automorphism of order 9

A method for constructing binary self-dual codes having an automorphism of order p ² for an odd prime p is presented in (S. Bouyuklieva et al. IEEE. Trans. Inform. Theory, 51, 3678–3686, 2005). Using this method, we investigate the optimal self-dual codes of lengths 60 ≤ n ≤ 66 having an automorphism of order 9 with six 9-cycles, t cycles of length 3 and f fixed points. We classify all self-dual [60,30,12] and [62,31,12] codes possessing such an automorphism, and we construct many doubly-even [64,32,12] and singly-even [66,33,12] codes. Some of the constructed codes of lengths 62 and 66 are with weight enumerators for which the existence of codes was not known until now.      

A (c. L*-Geometry for the Sporadic Group J2

We prove the existence of a rank three geometry admitting the Hall–Janko group J2 as flag-transitive automorphism group and Aut(J2) as full automorphism group. This geometry belongs to the diagram (c·L*) and its nontrivial residues are complete graphs of size 10 and dual Hermitian unitals of order 3.     

Classification of Formally Self-Dual Even Codes of Lengths up to 16

In this note, we give the complete classification of binary formally self-dual even codes of lengths 10, 12, 14 and 16. There are exactly fourteen, 29, 99 and 914 inequivalent such codes of lengths 10, 12, 14 and 16, respectively. This completes the classification of formally self-dual even codes of lengths up to 16. The first example of formally self-dual even code with a trivial automorphism group is also found. This shows that 16 is the smallest length for which there is a formally self-dual even code with a trivial automorphism group.     

Quadratic Double Circulant Codes over Fields

A generalization of the Pless symmetry codes to different fields is presented. In particular new infinite families of self-dual codes over GF(4), GF(5), GF(7), and GF(9) are introduced. It is proven that the automorphism group of some of these codes contains the group PSL₂(q). New codes over GF(4) and GF(5), with better minimum weight than previously known codes, are given.     

On the binary projective codes with dimension 6

All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and automorphism group orders is given.     

On the Binary Self-Dual Codes with an Automorphism of Order 2

Methods to design binary self-dual codes with an automorphism of order two without fixed points are presented. New extremal self-dual [40,20,8], [42,21,8],[44,22,8] and [64,32,12] codes with previously not known weight enumerators are constructed.     

The extremal codes of lengths 76 with an automorphism of order 19

We find all extremal [76,38,14] binary self-dual codes having automorphism of order 19. There are three inequivalent such codes. One of them was previously known. The other two are new. These codes are the shortest known self-dual codes of minimal weight 14 as well as the best-known linear codes of that length and dimension.