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

共 50 条

[21] Covering arrays, augmentation, and quilting arrays [J].

Colbourn, Charles J. .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (03)

[22] Covering arrays on graphs [J].

Meagher, K ;

Stevens, B .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (01) :134-151

[23] Covering arrays and hash families [J].

Colbourn, Charles J. .

INFORMATION SECURITY, CODING THEORY AND RELATED COMBINATORICS: INFORMATION CODING AND COMBINATORICS, 2011, 29 :99-135

[24] Problems and algorithms for covering arrays [J].

Hartman, A ;

Raskin, L .

DISCRETE MATHEMATICS, 2004, 284 (1-3) :149-156

[25] Group construction of covering arrays [J].

Meagher, K ;

Stevens, B .

JOURNAL OF COMBINATORIAL DESIGNS, 2005, 13 (01) :70-77

[26] Covering arrays from cyclotomy [J].

Charles J. Colbourn .

Designs, Codes and Cryptography, 2010, 55 :201-219

[27] Covering arrays from cyclotomy [J].

Colbourn, Charles J. .

DESIGNS CODES AND CRYPTOGRAPHY, 2010, 55 (2-3) :201-219

[28] Graphical methods for evaluating covering arrays [J].

Kim, Youngil ;

Jang, Dae-Heung ;

Anderson-Cook, Christine M. .

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2016, 32 (04) :1467-1481

[29] Heterogeneous Hash Families and Covering Arrays [J].

Colbourn, Charles J. ;

Torres-Jimenez, Jose .

ERROR-CORRECTING CODES, FINITE GEOMETRIES AND CRYPTOGRAPHY, 2010, 523 :3-+

[30] Covering arrays with mixed alphabet sizes [J].

Moura, L ;

Stardom, J ;

Stevens, B ;

Williams, A .

JOURNAL OF COMBINATORIAL DESIGNS, 2003, 11 (06) :413-432

← 1 2 3 4 5 →