In this note initial block technique hzs been used for construction of some cl=s of ## 3-associate PBIB designs, known as rectangular desigus. Let A = MX S be the Cartesian produd of M and S, where .M = (a~, a lr. . . , qn\_3 is an additive group of order m and S = (0, I,. . . , s -1). I& a,l' de
Construction of symmetric PBIB designs and related results
β Scribed by B.L. Misra; M.L. Chandak
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 254 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
UCGOII
Consider a fir iite module M with exactly u find k different elements x1, x2, . . . , xk out of following conditions. elements. Suppose it is possible to the u ele:men:s of 34 satisfying the (i) Among tht: k(k -I) differences 4 -x1, rf t, r; t = 1, 2,. . . , k, just ni of the non-zero elements of P/f are repeated hi times, i = 1,2, . . . , m. Clearly then
π SIMILAR VOLUMES
It is known that there exists only one (Tran van Trung's) design for (66,26,10) up to now. In this article we consider designs for (66,26,10) with the Frobenius group F39 and we prove that there exist (up to isomorphism) exactly 18 such designs. 0 1995 John Wiley & Sons, h e . In 1982, Tran van Trun
This article presents a construction of all symmetric designs with parameters (70,24.8) on which the group Es 3 F,, operates so that the automorphism of order 7 operates fixed-point-free. A method based on enumeration of cosets in group is used for the construction.
## KHARE and FEDERER (1981) presented a simple method for constructing incomplete block designs for any number of treatments. Their procedure is extended to constructing lattice square designs. Using variety cutting, lattice square designs are available for any number of treatments.
## Abstract A method of constructing resolvable nested 3βdesigns from an affine resolvable 3βdesign is proposed with one example. Β© 2004 Wiley Periodicals, Inc.