Binary consecutive covering arrays

Covering the edges with consecutive sets

✍ Guoli Ding 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

## Abstract The following question is answered in this note: for which graphs __G__ can the vertices of __G__ be linearly ordered so that all the minimal vertex covers of __G__ are consecutive sets?.

Group construction of covering arrays

✍ Karen Meagher; Brett Stevens 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

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

Mixed covering arrays on graphs

✍ Karen Meagher; Lucia Moura; Latifa Zekaoui 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract Covering arrays have applications in software, network and circuit testing. In this article, we consider a generalization of covering arrays that allows mixed alphabet sizes as well as a graph structure that specifies the pairwise interactions that need to be tested. Let __k__ and __n__

Covering arrays and intersecting codes

✍ N. J. A. Sloane 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn

Asymmetric Binary Covering Codes

✍ Joshua N Cooper; Robert B Ellis; Andrew B Kahng 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q n such that every vector x 2 Q n can be obtained from some vector c 2 C by changing at most R 1's of c to 0's, where R is as small as possible. K þ ðn; RÞ is defined as the smallest size of such a code. We show

Perfect binary arrays

✍ H.D. Lüke; L. Bömer; M. Antweiler 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 527 KB