Resolvable covering arrays

被引：0

作者：

Colbourn C.J. ^{[1
]}

机构：

[1] School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe

来源：

Journal of Statistical Theory and Practice | 2013年 / 7卷 / 4期

关键词：

Covering array; Interaction faults; Locating array;

D O I：

10.1080/15598608.2013.781461

中图分类号：

学科分类号：

摘要：

Two powerful recursive constructions of covering arrays of strengths three and four use difference covering arrays (DCAs). However, what is required in these constructions is not the algebraic structure of differences in a group, but rather that the DCAs produce covering arrays that are resolvable. Both constructions are strengthened by using resolvable covering arrays in place of DCAs. Many new difference covering arrays are found by computational methods, and resolvable covering arrays that do not arise from DCAs are produced. Improvements for bounds on covering array numbers are shown to be substantial. © 2013 Copyright Grace Scientific Publishing, LLC.

引用

页码：630 / 649

页数：19

共 20 条

[1]

Cohen M.B., Colbourn C.J., Ling A.C.H., Constructing strength three covering arrays with augmented annealing, Discrete Math., 308, pp. 2709-2722, (2008)

[2]

Colbourn C.J., Strength two covering arrays: Existence tables and projection, Discrete Math., 308, pp. 772-786, (2008)

[3]

Colbourn C.J., Covering Array Tables, (2011)

[4]

Colbourn C.J., Covering arrays and hash families, Information Security and Related Combinatorics, NATO Peace and Information Security, pp. 99-136, (2011)

[5]

Colbourn C.J., Dinitz J.H., Making the MOLS table, Computational and Constructive Design Theory, pp. 67-134, (1996)

[6]

Colbourn C.J., Dinitz J.H., Mutually orthogonal Latin squares: A brief survey of constructions, J. Stat. Plan. Inference, 95, pp. 9-48, (2001)

[7]

Colbourn C.J., Martirosyan S.S., Van Tran T., Walker II R.A., Roux-type constructions for covering arrays of strengths three and four, Des. Codes Cryptogr., 41, pp. 33-57, (2006)

[8]

Hartman A., Software and hardware testing using combinatorial covering suites, Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237-266, (2005)

[9]

Hedayat A.S., Sloane N.J.A., Stufken J., Orthogonal Arrays, (1999)

[10]

Ji L., Yin J., Constructions of new orthogonal arrays and covering arrays of strength three, J. Combin. Theory Ser. A, 117, 3, pp. 236-247, (2010)

← 1 2 →