Costruzione di frazioni regolari di risoluzione IV e V del piano fattoriale completo 2k

Abstract

In this paper we present a new algorithm for the construction of regular fractions of the complete factorial design 2k.
This algorithm is based on the number of coincidences of elements in different rows of the design matrix and it is a natural extension of the K-algorithm (Salmaso, 1996; Kounias and Salmaso, 1997) for designs of resolution IV and V.
We provide a complete catalogue of designs of resolution IV and V with N= 16 and 32 observations; such designs are evaluated by the degrees of freedom criterion (Kounias and Salmaso, 1998).