t-Covering arrays: Upper bounds and poisson approximations

Anant P. Godbole, Daphne E. Skipper, Rachel A. Sunley

Research output: Contribution to journalArticlepeer-review

53 Scopus citations

Abstract

A k × n array with entries from the g-letter alphabet {0,1,..., q-1} is said to be t-covering if each k × t submatrix has (at least one set of) qt distinct rows. We use the Lovász local lemma to obtain a general upper bound on the minimal number K = K(n,t,q) of rows for which a t-covering array exists; for t = 3 and q = 2, we are able to match the best-known such bound. Let Kλ = Kλ(n,t,q), (λ ≥ 2), denote the minimum number of rows that guarantees the existence of an array for which each set of t columns contains, amongst its rows, each of the qt possible 'words' of length t at least λ times. The Lovász lemma yields an upper bound on Kλ that reveals how substantially fewer rows are needed to accomplish subsequent t-coverings (beyond the first). Finally, given a random k × n array, the Stein-Chen method is employed to obtain a Poisson approximation for the number of sets of t columns that are deficient, i.e. missing at least one word.

Original languageEnglish (US)
Pages (from-to)105-117
Number of pages13
JournalCombinatorics Probability and Computing
Volume5
Issue number2
DOIs
StatePublished - Jan 1 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 't-Covering arrays: Upper bounds and poisson approximations'. Together they form a unique fingerprint.

Cite this