Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code — called the "carrier" — which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number of points of the system, the carrier organizes all the information necessary to construct directly all systems of the given order and $2$-rank from Steiner triple systems of a specified smaller order. The carriers are an easily understood, two-parameter family of binary codes related to the Hamming codes. We also discuss Steiner quadruple systems and prove an analogous existence and uniqueness theorem; in this case the binary code (corresponding to the carrier in the triple system case) is the dual of the code obtained from a first-order Reed-Muller code by repeating it a certain specified number of times. Some particularly intriguing possible enumerations and some general open problems are discussed. We also present applications of this coding-theoretic classification to the theory of triple and quadruple systems giving, for example, a direct proof of the fact that all triple systems are derived provided those of full 2-rank are and showing that whenever there are resolvable quadruple systems on $u$ and on $v$ points there is a resolvable quadruple system on $uv$ points. The methods used in both the classification and the applications make it abundantly clear why the number of triple and quadruple systems grows in such a staggering way and why a triple system that extends to a quadruple system has, generally, many such extensions.
[1]
Brendan D. McKay,et al.
There are 526,915,620 nonisomorphic one‐factorizations of K12
,
1994
.
[2]
Douglas R. Stinson,et al.
2000000 Steiner triple systems of order 19
,
1985
.
[3]
Robert S. Weishaar,et al.
Steiner triple systems of order 15 and their codes
,
1997
.
[4]
Eric Mendelsohn.
The smallest non-derived steiner triple system is simple as a loop
,
1978
.
[5]
K. Phelps.
A Survey of Derived Triple Systems
,
1980
.
[6]
Alexander Rosa,et al.
Steiner quadruple systems - a survey
,
1978,
Discret. Math..
[7]
P. Cameron.
Parallelisms Of Complete Designs
,
1976
.
[8]
Douglas R. Stinson,et al.
284457 Steiner triple systems of order 19 contain a subsystem of order 9
,
1986
.
[9]
Luc Teirlinck,et al.
On Projective and Affine Hyperplanes
,
1980,
J. Comb. Theory, Ser. A.
[10]
M. Reiss,et al.
Ueber eine Steinersche combinatorische Aufgabe, welche im 45sten Bande dieses Journals, Seite 181, gestellt worden ist.
,
1859
.
[11]
Jean Doyen,et al.
Ranks of incidence matrices of Steiner triple systems
,
1978
.
[12]
Jennifer D. Key,et al.
Designs and their codes
,
1992,
Cambridge tracts in mathematics.
[13]
Jacobus H. van Lint,et al.
Ovals in Projective Designs
,
1979,
J. Comb. Theory, Ser. A.
[14]
Michel Dehon,et al.
Designs et hyperplans
,
1977,
J. Comb. Theory, Ser. A.
[15]
J. D. Key,et al.
Designs and codes: An update
,
1996
.
[16]
Alexander Rosa,et al.
One-factorizations of the complete graph - A survey
,
1985,
J. Graph Theory.