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

Latin squares and mutually orthogonal sets of Latin squares (MOLS) have an old history
predating Euler's work in the late 1700s. With the emergence of the abstract concept of a …

Constructive and nonconstructive techniques are employed to enumerate Latin squares and
related objects. It is established that there are (i) $2036029552582883134196099 $ main …

We study (symmetric) three-class association schemes. The graphs with four distinct
eigenvalues which are one of the relations of such a scheme are characterized. We also …

We give an overview of results on amorphic association schemes. We give the known
constructions of such association schemes, and enumerate most such association schemes …

Steiner triple systems (STSs) with subsystems of order 7 are classified. For order 19, this
classification is complete, but for order 21 it is restricted to Wilson-type systems, which …

This study focuses on searching for pairs of orthogonal diagonal Latin squares of order 10.
Consider a cells mapping in accordance to which one diagonal Latin square is mapped to …

Various local transformations of combinatorial structures (codes, designs, and related
structures) that leave the basic parameters unaltered are here unified under the principle of …

Let be a quasigroup. Put and assume that. Let and be the number of left and right
translations of that are fixed point free. Put. Denote by the number of idempotents of. It is …

A k-regular graph on v vertices is a divisible design graph with parameters (v, k, λ 1, λ 2, m,
n) if its vertex set can be partitioned into m classes of size n, such that any two different …