Existence of balanced incomplete block designs for many sets of treatments

Authors:
M. Greig;D. H. Rees
Affiliations:
Greig Consulting, 317-130 East 11th Street, North Vancouver, BC, Canada V7L 4R3;Institute of Mathematics and Statistics, University of Kent at Canterbury, Canterbury, Kent CT2 7NF, UK
Venue:
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Year:
2003

Citing 6
Cited 2

Design theory

Design theory
Difference families from rings

Discrete Mathematics - Special volume: Designs and Graphs
Perfect Mendelsohn designs with block size six

Discrete Mathematics
Existence of (q,6,1) Difference Families withq a Prime Power

Designs, Codes and Cryptography
Perfect Graeco-Latin balanced incomplete block designs (pergolas)

Discrete Mathematics
(3,6) GWhD(v): existence results

Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa

Existence of OBIBDs with k = 4 with and without nesting

Discrete Mathematics - Special issue: The 18th British combinatorial conference
A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A range of methods is presented for the recursive construction of sets of orthogonal balanced incomplete block designs. To enable these methods, some new types of designs are defined. Some examples of these are given, and pairs of orthogonal BIBDs constructed for k = 3, λ = 2, for all but 12 values of v where v ≡ 0, 1 (mod 3) with v ≥ 6.