Covering Arrays of Strength Three

Authors:
M. A. Chateauneuf;Charles J. Colbourn;D. L. Kreher
Affiliations:
Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931-1295.;Department of Computer Science, University of Vermont, Burlington, Vermont 05405.;Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931-1295.
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 4
Cited 4

Concerning Difference Matrices

Designs, Codes and Cryptography - Special issue containing papers presented at the Second Upper Michigan Combinatorics Workshop on Designs, Codes and Geometries
The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
The Combinatorial Design Approach to Automatic Test Generation

IEEE Software
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

On t-Covering Arrays

Designs, Codes and Cryptography
Covering arrays on graphs

Journal of Combinatorial Theory Series B
Roux-type constructions for covering arrays of strengths three and four

Designs, Codes and Cryptography
A backtracking search tool for constructing combinatorial test suites

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A coveringarray of size N, degree k, orderv and strength t is a k \timesN array with entries from a set of v symbolssuch that in any t \times N subarray every t\times 1 column occurs at least once. Covering arrayshave been studied for their applications to drug screening andsoftware testing. We present explicit constructions and giveconstructive upper bounds for the size of a covering array ofstrength three.