Ray-Chaudhuri, D.K., T. Zhu, A recursive method for construction of designs, Discrete Mathematics 106/107 (1992) 399-406. In this paper, we generalize Blanchard and Narayani's constructions of designs in the following ways. (1) By applying an orthogonal array to the construction, we can reduce the
A recursive method of construction of resolvable BIB-designs
β Scribed by B. T. Rumov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1977
- Tongue
- English
- Weight
- 340 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A method of constructing resolvable nested 3βdesigns from an affine resolvable 3βdesign is proposed with one example. Β© 2004 Wiley Periodicals, Inc.
A method of construction of certain balanced incomplete block (BIB) designs is defined from which we get new series of BIB designs. ## 1 . Introduction For a BIB design with parameters v, b, r , k, I if the blocks can be separated into t
In this note a method of construction of certain combinatorial designs is defined. This gives the solution of (121, 132, 60, 55, 27) which is marked as unknown by Kageyama [l].
The construction of resolvable incomplete block and row-column designs is investigated when the treatments have a nested structure. Some theoretical results are derived for lattice designs. Efficient designs for unequal-sized treatment groups are obtained by defining a multiple objective function an
## We given a new version of a theorem of Clay concerning the construction of BIB designs from Frobenius groups. In a recent paper [l] Clay describes a method of constructing BIB designs from Frobenius groups. Let G = N X @ be a Frobenius group with kernel N and complement @. With the same notatio