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. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 202-213 |
| Number of pages | 12 |
| Journal | Journal of Combinatorial Designs |
| Volume | 14 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1 2006 |
Keywords
- Covering array
- Orthogonal array
- Perfect hash family
- Permutation vector
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
Fingerprint Dive into the research topics of 'Covering arrays of higher strength from permutation vectors'. Together they form a unique fingerprint.
Cite this
Sherwood, G. B., Martirosyan, S. S., & Colbourn, C. (2006). Covering arrays of higher strength from permutation vectors. Journal of Combinatorial Designs, 14(3), 202-213. https://doi.org/10.1002/jcd.20067