| A covering array CAlambda( N; t, k, v) is a k x N array on a set of v symbols with the property that in each of its t x N subarrays every t-tuple with entries from v is in at least lambda columns. This thesis examines eight constructions for covering arrays that employ a cover starter kappa x 1 array. Two of these constructions have been previously researched. This thesis uses previously unused permutation groups, expanded ranges of search, and six new constructions to deepen the knowledge of cover starter based constructions. New least upper bounds on covering arrays are produced, new lower bounds on the spectra of existences of the cover starters and patterns of existence of orthogonal arrays by these constructions are proven. |
