Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 ฀ Classification Algorithms for Codes and Designs Classification …

We discuss algorithms for the construction of Hadamard matrices. We include discussion of
construction using Williamson matrices, Legendre pairs and the discret Fourier transform …

In this paper, new binary extremal self-dual codes are presented. A number of new extremal
singly-even self-dual codes of lengths 48, 64 and 78, and extremal doubly-even self-dual …

We develop an algorithm framework for isomorph-free exhaustive generation of designs
admitting a group of automorphisms from a prescribed collection of pairwise nonconjugate …

Computing the autotopism group of a partial Latin rectangle (PLR) can be performed in
multiple ways. This study has two aims: comparing some of these methods experimentally to …

A new coding construction scheme of block codes using short base codes and permutations
that enables the construction of binary self-dual codes is presented in Cadic et al.(2001) and …

The known structure of the automorphism group of the extended binary quadratic-residue
code of length 80 is used for the construction of 36 new extremal doubly-even codes of …

A recurrently occurring problem in combinatorics is the need to completely characterize a
finite set of finite objects implicitly defined by a set of constraints. For example, one could ask …

All Hadamard 2-(63, 31, 15) designs invariant under the dihedral group of order 10 are
constructed and classified up to isomorphism together with related Hadamard matrices of …

The resolvability of combinatorial designs is intensively investigated because of its
applications. This research focuses on resolvable designs with an additional property-they …