Products of mixed covering arrays of strength two

作者: 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

参考文章(27)
Gary Mullen, David White, A polynomial representation for logarithms in GF(q) Acta Arithmetica. ,vol. 47, pp. 255- 261 ,(1986) , 10.4064/AA-47-3-255-261
Brett Stevens, Lucia Moura, Eric Mendelsohn, Lower Bounds for Transversal Covers Designs, Codes and Cryptography. ,vol. 15, pp. 279- 299 ,(1998) , 10.1023/A:1008329410829
Charles J. Colbourn, Combinatorial aspects of covering arrays Le Matematiche. ,vol. 59, pp. 125- 172 ,(2006)
I.S. Dunietzl, B.D. Szablak, W.K. Ehrlich, C.L. Mallows, A. Iannino, Applying Design of Experiments to Software Testing international conference on software engineering. pp. 205- 215 ,(1997) , 10.1109/ICSE.1997.610252
CRC Handbook of Combinatorial Designs Journal of the American Statistical Association. ,vol. 92, pp. 800- ,(1996) , 10.1201/9781420049954
Esther Seiden, Rita Zemach, On Orthogonal Arrays Annals of Mathematical Statistics. ,vol. 37, pp. 1355- 1370 ,(1966) , 10.1214/AOMS/1177699280
Svatopluk Poljak, Zsolt Tuza, On the maximum number of qualitatively independent partitions Journal of Combinatorial Theory, Series A. ,vol. 51, pp. 111- 116 ,(1989) , 10.1016/0097-3165(89)90081-2
Brett Stevens, Eric Mendelsohn, New recursive methods for transversal covers Journal of Combinatorial Designs. ,vol. 7, pp. 185- 203 ,(1999) , 10.1002/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3
M. Chateauneuf, D. L. Kreher, On the state of strength-three covering arrays Journal of Combinatorial Designs. ,vol. 10, pp. 217- 238 ,(2002) , 10.1002/JCD.10002
Kari J. Nurmela, Upper bounds for covering arrays by tabu search Discrete Applied Mathematics. ,vol. 138, pp. 143- 152 ,(2004) , 10.1016/S0166-218X(03)00291-9