On the state of strength-three covering arrays

被引:89
作者
Chateauneuf, M
Kreher, DL
机构
[1] Univ Waterloo, Ctr Appl Cryptog Res, Waterloo, ON N2L 3G1, Canada
[2] Michigan Technol Univ, Dept Math Sci, Houghton, MI 49931 USA
关键词
covering array; transversal cover; orthogonal array; software testing;
D O I
10.1002/jcd.10002
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A covering array of size N, strength t, degree k, and order v is a k x N array on v symbols in which every t x N subarray contains every possible t x 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression. (C) 2002 Wiley Periodicals, Inc.
引用
收藏
页码:217 / 238
页数:22
相关论文
共 31 条
[1]  
Atici M, 1996, J COMB DES, V4, P353
[2]  
Bierbrauer J, 2000, LECT NOTES COMPUT SC, V1880, P533
[3]  
BIERBRAUER J, 2001, DIMACS SERIES DISCRE, V56, P33
[4]   Perfect hash families: Probabilistic methods and explicit constructions [J].
Blackburn, SR .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2000, 92 (01) :54-60
[5]  
BOYAR J, 1995, JACM, V42, P1196
[6]   Oblivious transfers and intersecting codes [J].
Brassard, G ;
Crepeau, C ;
Santha, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1769-1780
[7]  
CARTER L, 1979, J CSS, V18, P143, DOI DOI 10.1016/0022-0000(79)90044-8
[8]   Covering arrays of strength three [J].
Chateauneuf, MA ;
Colbourn, CJ ;
Kreher, DL .
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 16 (03) :235-242
[9]  
Cohen D. M., 1994, Proceedings. 5th International Symposium on Software Reliability Engineering (Cat. No.94TH8017), P303, DOI 10.1109/ISSRE.1994.341392
[10]   The AETG system: An approach to testing based on combinatorial design [J].
Cohen, DM ;
Dalal, SR ;
Fredman, ML ;
Patton, GC .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (07) :437-444