Results 111 to 120 of about 36,156 (153)
Some of the next articles are maybe not open access.
Some new group divisible designs
Journal of Statistical Planning and Inference, 1977Abstract The paper lists fourteen new group divisible PBIB/2 designs, which were obtained using the computer program described in John (1976).
John, J. A., Turner, G.
openaire +1 more source
Some new group divisible designs
Journal of Statistical Planning and Inference, 1980Abstract The paper lists four new group divisible designs which are obtained by trial and error. These designs are believed to be new, since they are not listed in Clatworthy (1973), Freeman (1976) or John and Turner (1977).
null Bhagwandas, J.S. Parihar
openaire +1 more source
Spreads and group divisible designs
Designs, Codes and Cryptography, 1993This paper establishes a beautiful relation between geometric \(t\)-spreads and group divisible designs the dual of which is again a group divisible design. Let \({\mathcal S}\) be a \(t\)-spread of \(PG(d,q)\), i.e. a partition of the point set of \(PG(d,q)\) in \(t\)-dimensional subspaces, called the component of \({\mathcal S}\).
O'Keefe, Christine M., Rahilly, Alan
openaire +1 more source
Generalizing Clatworthy group divisible designs
Journal of Statistical Planning and Inference, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodger, C. A., Rogers, Julie
openaire +1 more source
Some Results on Group Divisible Designs
Calcutta Statistical Association Bulletin, 1981A condition is established for obtaining a Group Divisible (GD) design from an asymmetric Bm design. A method is also given for constructing a variance balanced design from a GD design.
openaire +1 more source
On Automorphism Groups of Divisible Designs
Canadian Journal of Mathematics, 1982A (group) divisible design is a tactical configuration for which the v points are split into m classes of n each, such that points have joining number λ (resp. λ2) if and only if they are in the same (resp. in different) classes. We are interested in such designs with a nice automorphism group.
openaire +1 more source
Constant Weight Codes and Group Divisible Designs
Designs, Codes and Cryptography, 1999This paper continues the study of optimal constant weight codes over arbitrary alphabets which was initiated by \textit{T. Etzion} [Optimal constant weight codes over \(Z_k\) and generalized designs, Discrete Math. 169, No. 1-3, 55-82 (1997)]. Etzion showed that such codes are equivalent to special GDD's known as generalized Steiner systems \(\text{GS}(
Blake-Wilson, Simon, Phelps, Kevin T.
openaire +1 more source
Group Divisible Second Order Rotatable Designs
Biometrical Journal, 1979AbstractThe Group Divisible Rotatable (GDR) designs are the designs in which the factors get divided into groups such that for the factors within group, the designs are rotatable. In the present paper we have obtained a series of Group Divisible Second Order Rotatable designs, by decomposing the v‐dimensional space corresponding to v‐factors under ...
openaire +2 more sources
Constructions of Resolvable Group Divisible Designs and Related Designs
Annals of Combinatorics, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitra, R. K. +3 more
openaire +2 more sources
Group divisible rotatable designs —Some further considerations
Annals of the Institute of Statistical Mathematics, 1968The paper discusses a method of construction of “Group divisible rotatable designs”. Through this method 5-level designs are obtained with smaller number of points. A series of 3-level designs has also been put forward.
Dey, A., Nigam, A. K.
openaire +2 more sources