Contents

-

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Some New Simple t-Designs

D. de Caen1, Y. M. Chee2, C. J. Colbourn3, E. S. Kramer4, D. L. Kreher5
1Dept. of Mathematics Queens University Kingston, Ontario K7L 3N6 CANADA
2Dept. of Computer Science University of Waterloo University of Waterloo CANADA
3Dept. of Combinatorics and Optimization University of Waterloo Waterloo, Ontario N2L 3G1 CANADA
4Dept. of Mathematics and Statistics University of Nebraska – Lincoln Lincoln, Nebraska 68588 U.S.A.
5Dept. of Computer Science Rochester Institute of Technology Rochester, New York 14623 U.S.A.
  • Published: 30/04/1990

Abstract

The concept of using basis reduction for finding t–(v,k,λ) designs without repeated blocks was introduced by D. L. Kreher and S. P. Radziszowski at the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory and Computing. This tool and other algorithms were packaged into a system of programs that was called the design theory toolchest. It was distributed to several researchers at different institutions. This paper reports the many new open parameter situations that were settled using this toolchest.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.