Factorial designs are widely used in many scientific and industrial investigations. The
objective of this book is to provide a rigorous, systematic, and up-to-date treatment of the …

Given a two-level regular fractional factorial design of resolution IV, the method of doubling
produces another design of resolution IV which doubles both the run size and the number of …

More than thirty new upper bounds on the smallest size t 2 (2, q) of a complete arc in the
plane PG (2, q) are obtained for (169≤ q≤ 839. New upper bounds on the smallest size t 2 …

Strength three two-level orthogonal arrays with the number of runs (N) equaling twice the
number of factors (k) are second-order saturated (SOS) designs. That is, for such designs …

A new family of small complete caps in PG (N, q), q even, is constructed. Apart from small
values of either N or q, it provides an improvement on the currently known upper bounds on …

Let be a finite field of odd characteristic. For an integer, let be the generalized Zetterberg
code of length over. If is even, then we prove that the covering radius of is 3. Put. If is odd …

In binary projective spaces PG (v, 2), minimal 1-saturating sets, including sets with inner
lines and complete caps, are considered. A number of constructions of the minimal 1 …

We want to provide some background from coding theory and geometry. Let C be a binary
linear code of length N, dimension k, and minimum distance at least 4. Let G be a generator …

We prove that a non-trivial minimal blocking set with respect to hyperplanes in PG (r, 2), r≥
3, is a skeleton contained in some s-flat with odd s≥ 3. We also consider non-trivial minimal …

It is known that all resolution IV regular 2 n− m designs of run size N= 2 n− m where 5 N/16<
n< N/2 must be projections of the maximal even design with N/2 factors and, therefore, are …