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

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

A binary code C⊆ F 2 n with minimum distance at least d and codewords of Hamming
weight w is called an (n, d, w) constant weight code. The maximum size of an (n, d, w) …

Abstract Properties of the 11$\, $084 $\, $874 $\, $829 Steiner triple systems of order 19 are
examined. In particular, there is exactly one 5-sparse, but no 6-sparse, STS (19); there is …

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 …

An embedding of a graph in a surface gives rise to a combinatorial design whose blocks
correspond to the faces of the embedding. Particularly interesting graphs include complete …

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

The concept of Schreier extensions of loops was introduced in the general case in [11] and,
more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it …

A Steiner triple system of order v, STS (v), together with a resolution of its blocks is called a
Kirkman triple system of order v, KTS (v). A KTS (v) exists if and only if v≡ 3 (mod 6). The …