covering array;
orthogonal array;
group action;
perfect hash family;
D O I:
10.1023/A:1008379710317
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
A covering an array of size N, degree k, order nu and strength t is a k x N array with entries from a set of nu symbols such that in any t x N subarray every t x 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.