Some properties on resolvability of variance-balanced designs
In a \((\mu_ 1,\mu_ 2,...,\mu_ t)\)-resolvable block design, the b blocks can be divided into t sets of \(m_ i\) blocks each such that the set of \(m_ i\) blocks contains each of the v treatments exactly \(\mu_ i\) times \((i=1,2,...,t)\). A block design is known to be variance balanced if its usual C-matrix is a completely symmetric matrix \(\lambda\). It is shown that \(b\geq v+t-1\) for a \((\mu_ 1,\mu_ 2,...,\mu_ t)\)- resolvable, variance balanced design and properties of such designs are investigated when the lower bound for b is attained.
- Existence of variance-balanced binary designs with fewer experimental units
- The family of block designs with some combinatorial properties
- scientific article; zbMATH DE number 4163952 (Why is no real title available?)
- On resolvable and affine resolvable variance-balanced designs
- A Note on a Parametric Relation of Variance Balanced Block Designs
- New bound for affine resolvable designs and its application to authentication codes
This page was built for publication: Some properties on resolvability of variance-balanced designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792326)
