Author:
Colbourn Charles J, ,Kreher Donald L,Ostergård Patric R. J, ,
Abstract
In 1853, Steiner posed a number of combinatorial (tactical) problems, which eventually led to a large body of research on Steiner systems.
However, solutions to Steiner's questions coincide with Steiner systems only for strengths two and three.
For larger strengths, essentially only one class of solutions to Steiner's tactical problems is known, found by Bussey more than a century ago.
In this paper, the relationships among Steiner systems, perfect binary one-error-correcting codes, and solutions to Steiner's tactical problem (Bussey systems) are discussed.
For the latter, computational results are provided for at most 15 points.
Publisher
University of Zagreb, Faculty of Science, Department of Mathematics
Reference67 articles.
1. W. O. Alltop, Extending \(t\)-designs, J. Combinatorial Theory Ser. A 18 (1975), 177-186.
2. I. Anderson, C. J. Colbourn, J. H. Dinitz, and T. S. Griggs, Design theory: Antiquity to 1950, in: Handbook of combinatorial designs, Chapman and Hall/CRC, Boca Raton, 2007, 11-22.
3. J. E. F. Assmus Jr. and J. H. F. Mattson Jr., On tactical configurations and error-correcting codes, J. Combinatorial Theory 2 (1967), 243-257.
4. W. W. R. Ball, Mathematical recreations and essays, The Macmillan Company, London, 1914.
5. J. A. Barrau, On the combinatory problem of Steiner, Nederl. Akad. Wetensch. Proc. Ser. B 11 (1908), 352-360.