Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs

2004 ◽  
Vol 119 (2) ◽  
pp. 401-410 ◽  
Author(s):  
Sunanda Bagchi
1986 ◽  
Vol 35 (3-4) ◽  
pp. 157-160
Author(s):  
D. V. S. Sastry ◽  
R. H. Malgaonkar

This paper gives a method of construction of balanced incomplete block designs (BIBDs) and group divisible designs from the existing self complementary BIBDs.


1992 ◽  
Vol 45 (1) ◽  
pp. 61-69
Author(s):  
Alan Rahilly

A construction method for group divisible designs is employed to construct (i) infinitely many non-symmetric semiregular group divisible designs whose duals are semiregular group divisible designs, and (ii) infinitely many transversal designs whose duals are group divisible 3-associate designs. A construction method for affine α−resolvable balanced incomplete block designs is also given and illustrated.


1964 ◽  
Vol 16 ◽  
pp. 736-740 ◽  
Author(s):  
S. S. Shrikhande

The purpose of this note is to point out some connexions between generalized Hadamard matrices (4, 5) and various tactical configurations such as group divisible designs (3), affine resolvable balanced incomplete block designs (1), and orthogonal arrays of strength two (2). Some constructions for these arrays are also indicated.A balanced incomplete block design (BIBD) with parameters v, b, r, k, λ is an arrangement of v symbols called treatments into b subsets called blocks of k < v distinct treatments such that each treatment occurs in r blocks and any pair of treatments occurs in λ blocks.


Author(s):  
Oluwaseun A. Otekunrin ◽  
Kehinde O. Alawode

Group Divisible PBIBDs are important combinatorial structures with diverse applications. In this paper, we provided a construction technique for Group Divisible (v-1,k,0,1) PBIBDs. This was achieved by using techniques described in literature to construct Nim addition tables of order 2n, 2≤n≤5 and (k2,b,r,k,1)Resolvable BIBDs respectively. A “block cutting” procedure was thereafter used to generate corresponding Group Divisible (v-1,k,0,1) PBIBDs from the (k2,b,r,k,1)Resolvable BIBDs. These procedures were streamlined and implemented in MATLAB. The generated designs are regular with parameters(15,15,4,4,5,3,0,1);(63,63,8,8,9,7,0,1);(255,255,16,16,17,15,0,1) and (1023,1023,32,32,33,31,0,1). The MATLAB codes written are useful for generating the blocks of the designs which can be easily adapted and utilized in other relevant studies.   Also, we have been able to establish a link between the game of Nim and Group Divisible (v-1,k,0,1) PBIBDs.


1981 ◽  
Vol 30 (3-4) ◽  
pp. 115-122
Author(s):  
A. C. Mukhopadhyay

In the present paper an infinite series of Ba1am:ed ortbozonal designs (BOD's) is constructed for each s, an odd prime number or prime power and hence some infinite series of balanced incomplete block designs (BIBD's) and symmetrical group divisible designs (SGDD's) witb dual Ptoperty. Following Bose (1977), equivalences of some series of SGDD's with dual property are cstablished and their equivalence with corresponding series of BOD's is pointed out.


Sign in / Sign up

Export Citation Format

Share Document