✦ LIBER ✦

Group construction of covering arrays

✍ Scribed by Karen Meagher; Brett Stevens

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 112 KB
Volume: 13
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20035

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A covering array t‐CA (n, k, g) is a k × n array on a set of g symbols with the property that in each t × n subarray, every t × 1 column appears at least once. This paper improves many of the best known upper bounds on n for covering arrays, 2‐CA (n, k, g) with g + 1 ≤ k ≤ 2__g__, for g = 3 · · · 12 by a construction which in many of these cases produces a 2‐CA (n, k, g) with n = k (g − 1) + 1. The construction is an extension of an algebraic method used by Chateauneuf, Colbourn, and Kreher which uses an array and a group action on the array. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 70–77, 2005.

📜 SIMILAR VOLUMES

Products of mixed covering arrays of str

Products of mixed covering arrays of strength two

✍ Charles J. Colbourn; Sosina S. Martirosyan; Gary L. Mullen; Dennis Shasha; Georg 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract A __covering array__ __CA__(__N__;__t__,__k__, __v__ is an __N__ × __k__ array such that every __N__ × __t__ subarray 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 t

On the state of strength-three covering

On the state of strength-three covering arrays

✍ M. Chateauneuf; D. L. Kreher 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract A __covering array__ of __size__ __N__, __strength__ __t__, __degree k__, and __order__ υ is a __k × N__ array on υ symbols in which every __t × N__ subarray contains every possible __t__ × 1 column at least once. We present explicit constructions, constructive upper bounds on the size

Covering arrays of higher strength from

Covering arrays of higher strength from permutation vectors

✍ George B. Sherwood; Sosina S. Martirosyan; Charles J. Colbourn 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## 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

Automorphism Groups of Covering Graphs

✍ Norbert Seifter; Vladimir I. Trofimov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Â2-transitive and 1-regular graphs.

A Construction of the Held Simple Group

✍ G. Stroth 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Symmetry Groups of Boolean Functions and

Symmetry Groups of Boolean Functions and Constructions of Permutation Groups

✍ Andrzej Kisielewicz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 273 KB

In this paper we deal with the symmetry group S f of a boolean function f on n-variables, that is, the set of all permutations on n elements which leave f invariant. The main problem is that of concrete representation: which permutation Ž . groups on n elements can be represented as G s S f for some