Asymptotic and constructive methods for covering perfect hash families and covering arrays

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 re...

Ausführliche Beschreibung