Abstract
A covering array CA(N;t,k,v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many "Roux-type" constructions. A numerical comparison with current construction techniques is given through existence tables for covering arrays.
Original language | English (US) |
---|---|
Pages (from-to) | 33-57 |
Number of pages | 25 |
Journal | Designs, Codes, and Cryptography |
Volume | 41 |
Issue number | 1 |
DOIs | |
State | Published - Oct 2006 |
Keywords
- Covering array
- Difference matrix
- Orthogonal array
ASJC Scopus subject areas
- Theoretical Computer Science
- Applied Mathematics
- Discrete Mathematics and Combinatorics
- Computer Science Applications