作者: Charles J. Colbourn , Sosina S. Martirosyan , Gary L. Mullen , Dennis Shasha , George B. Sherwood
DOI: 10.1002/JCD.20065
关键词:
摘要: A covering arrayCA(N;t,k, v is an N × k array such that every N × t subarray contains all t-tuples from symbols at least once, where t the strength of array. Covering arrays are used to generate software test suites cover t-sets component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both develop combinatorial constructions and provide effective algorithmic search techniques. In this paper, a simple “cut-and-paste” construction extended in which different columns (factors) admit numbers (values); process improved recursive for with derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006