Covering perfect hash families represent certain covering arrays compactly. Applying two probabilistic methods to covering perfect hash families improves upon the asymptotic upper bound for the minimum number of rows in a covering array with v symbols, k columns, and strength t. One bound can be realized by a randomized polynomial time construction algorithm using column resampling, while the other can be met by a deterministic polynomial time conditional expectation algorithm. Computational results are developed for both techniques. Further, a random extension algorithm further improves on the best known sizes for covering arrays in practice. An extensive set of computations with column resampling and random extension yields explicit constructions when k≤ 75 for strength seven, k≤ 200 for strength six, k≤ 600 for strength five, and k≤ 2500 for strength four. When vCloseSPigtSPi 3 , almost all known explicit constructions are improved upon. For strength t= 3 , restrictions on the covering perfect hash family ensure the presence of redundant rows in the covering array, which can be removed. Using restrictions and random extension, computations for t= 3 and k≤ 10 , 000 again improve upon known explicit constructions in the majority of cases. Computations for strengths three and four demonstrate that a conditional expectation algorithm can produce further improvements at the expense of a larger time and storage investment.
- Asymptotic bound
- Conditional expectation algorithm
- Covering array
- Covering perfect hash family
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics