Covering arrays for some equivalence classes of words

Covering arrays for words of length t over a d-letter alphabet are k x n arrays with entries from the alphabet so that for each choice of t columns, each of the d(t) t-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case known as partitioning hash families, words are equivalent if they induce the same partition of a t element set. In the second case, words of the same weight are equivalent. In both cases, we produce logarithmic upper bounds on the minimum size k = k (n) of a covering array. Definitive results for t = 2, 3, 4, as well as general results, are provided.