Group construction of covering arrays

By Karen Meagher, Brett Stevens. 2005

59 citations recorded by the source corpus.

Subfields: Electrical and Electronic Engineering, Hardware and Architecture, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/55f26ad87226883093bfc9d99856fbabfed1c719

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

1. Charles J. Colbourn
2. Karen Meagher
3. Changhai Nie
4. Hareton K. N. Leung

In Hardware and Architecture

1. Charles J. Colbourn
2. Karen Meagher
3. Changhai Nie
4. Hareton K. N. Leung

In Management Science and Operations Research

1. Charles J. Colbourn
2. Karen Meagher
3. Changhai Nie
4. Hareton K. N. Leung

Citations in the corpus

• Covering arrays of higher strength from permutation vectors (2006, background): “Compare also with arrays given in [14] as follows:”
• Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory (2007, methodology): “.4.11 that there exists a CA(2k2 −k,k(k+ 1),k). We give here a new construction that can be used to build covering arrays CA(n,r,k), where k2 ≤n≤2k2 −kand k+1 ≤r≤k(k+1). This construction appeared in [51, 55]. This construction involves selecting a subgroup of the symmetric group on kelements, G<”
• Combinatorial aspects of covering arrays (2006, background): “We focus on the case when every factor has the same number of levels, since tables are available in the literature [89], [120].”