Results 101 to 110 of about 14,988 (146)

Constructions of Group Divisible Designs

Designs, Codes and Cryptography, 1996
This paper presents some constructions for group divisible designs from generalized partial difference matrices. Certain classes of examples are also given.
openaire   +2 more sources

Group-divisible rotatable designs

Annals of the Institute of Statistical Mathematics, 1967
By modifying the restrictions imposed on the levels of the factors in a second order rotatable design, an alternative series of response surface designs has been obtained. Thev factors of the design have been split into two groups, and the design is rotatable for each group of factors when the levels of the factors in the other group are held constant.
Das, M. N., Dey, A.
openaire   +2 more sources

A generalization of group divisible t $t$‐designs

Journal of Combinatorial Designs, 2023
AbstractCameron defined the concept of generalized ‐designs, which generalized ‐designs, resolvable designs and orthogonal arrays. This paper introduces a new class of combinatorial designs which simultaneously provide a generalization of both generalized ‐designs and group divisible ‐designs.
Sijia Liu, Yue Han, Lijun Ma, Lidong Wang, Zihong Tian   +4 more
openaire   +2 more sources

Some new group divisible designs

Journal of Statistical Planning and Inference, 1977
Abstract 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, 1980
Abstract 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, 1993
This 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, 2010
zbMATH 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, 1981
A 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, 1982
A (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, 1999
This 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