Construction of orthogonal and nearly orthogonal designs for computer experiments

This paper presents new infinite families of orthogonal designs for computer experiments. In cases where orthogonal designs cannot exist, we construct alternative, nearly orthogonal designs. Our designs can accommodate many factors and a large set of levels. No iterative computer search is required. To build up the desired orthogonal designs we develop and use new infinite classes of periodic Golay pairs.