Covering arrays of strength three

被引：59

作者：

Chateauneuf, MA ^{[1
]}

Colbourn, CJ

Kreher, DL

机构：

[1] Michigan Technol Univ, Dept Math Sci, Houghton, MI 49931 USA

[2] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 1999年 / 16卷 / 03期

关键词：

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.

引用

页码：235 / 242

页数：8

共 13 条

[1]

Atici M, 1996, J COMB DES, V4, P353

[2] 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

[3] The combinatorial design approach to automatic test generation [J].

Cohen, DM ;

Dalal, SR ;

Parelius, J ;

Patton, GC .

IEEE SOFTWARE, 1996, 13 (05) :83-88

[4]

Colbourn C. J., 1996, The CRC handbook of combinatorial designs

[5]

Colbourn C.J., 1996, DESIGN CODE CRYPTOGR, V9, P61

[6] SPERNER CAPACITIES [J].

GARGANO, L ;

KORNER, J ;

VACCARO, U .

GRAPHS AND COMBINATORICS, 1993, 9 (01) :31-46

[7]

Godbole A.P., 1996, Combinatorics, Probability and Computing, V5, P105

[8] COMPRESSING INCONSISTENT DATA [J].

KORNER, J ;

LUCERTINI, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) :706-715

[9]

Kreher DL, 1996, J COMB DES, V4, P67, DOI 10.1002/(SICI)1520-6610(1996)4:1<67::AID-JCD7>3.0.CO

[10]

2-Y

← 1 2 →