The book is composed of two volumes, each consisting of five chapters. In Vol ume I,
following some statistical motivation based on a randomization model, a general theory of …

A PBIB design based on L2 association scheme with parameters: v= p 2, b= pp− 1, r= p− 1,
k= p, λ 1= 0, λ 2= 1, n 1= 2 p− 1, n 2= p− 1 2 has been constructed in literature using …

Rectangular designs are classified as regular, Latin regular, semi-regular, Latin semi-
regular and singular designs. Some series of self-dual as well as α–resolvable designs …

A balanced incomplete block (BIB) design with parameters v, b, r, k, λ is a block design,
BIBD (v, b, r, k, λ), with v treatments and b blocks of size k each such that every treatment …

In this paper, we present a general construction of group divisible designs and rectangular
designs by utilising resolvable and “almost resolvable” balanced incomplete block designs …

The present article establishes equivalence between extended group divisible (EGD)
designs and designs for crop sequence experiments. This equivalence has encouraged the …

Some constructions of balanced arrays of strength two are provided by use of rectangular
designs, group divisible designs, and nested balanced incomplete block designs. Some …

An (n, M, d; q) code is called equidistant code if the Hamming distance between any two
codewords is d. It was proved that for any equidistant (n, M, d; q) code, d⩽ nM (q-1)/(M-1) q …

A new series of s (s≥ 3) associate class Partially Balanced Incomplete Block (PBIB) designs
have been constructed by applying hamming distance on Karnaugh maps. In this series …

Several methods of constructing group divisible (GD) designs are given by use of
rectangular designs and nested balanced incomplete block designs. The GD designs …