✦ LIBER ✦

Covering arrays and intersecting codes

✍ Scribed by N. J. A. Sloane

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 680 KB
Volume: 1
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.3180010106

No coin nor oath required. For personal study only.

✦ Synopsis

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 Rknyi, Katona, and Kleitman and Spencer. The present article is concerned with the case t = 3, where important (but unpublished) contributions were made by Busschbach and Roux in the 1980s. One of the principal constructions makes use of intersecting codes (linear codes with the property that any two nonzero codewords meet). This article studies the properties of 3-covering arrays and intersecting codes, and gives a table of the best 3-covering arrays presently known. For large n the minimal k satisfies 3.21256 < k / log n < 7.56444. 01993

📜 SIMILAR VOLUMES

Intersecting codes and partially identif

Intersecting codes and partially identifying codes

✍ G. Cohen; S. Encheva; S. Litsyn 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Classification of binary covering codes

✍ Patric R. J. Östergård; William D. Weakley 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

On covering sets and error-correcting co

On covering sets and error-correcting codes

✍ J.G Kalbfleisch; R.G Stanton; J.D Horton 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 811 KB

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__

On the covering radius of cyclic linear

On the covering radius of cyclic linear codes and arithmetic codes

✍ Tor Helleseth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC