Covering Arrays of Strength Three

M. A. Chateauneuf, Charles J. Colbourn, D. L. Kreher

Research output: Contribution to journalArticle

50 Scopus citations

Abstract

A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

Original languageEnglish (US)
Pages (from-to)235-242
Number of pages8
JournalDesigns, Codes, and Cryptography
Volume16
Issue number3
DOIs
StatePublished - Jan 1 1999
Externally publishedYes

    Fingerprint

Keywords

  • Covering array
  • Group action
  • Orthogonal array
  • Perfect hash family

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Cite this