Abstract

Augmentation is an operation to increase the number of symbols in a covering array, without unnecessarily increasing the number of rows. For covering arrays of strength two, one type of augmentation forms a covering array on v symbols from one on v-1 symbols together with v-1 covering arrays each on two symbols. A careful analysis of the structure of the optimal binary covering arrays underlies an augmentation operation that reduces the number of rows required. Consequently a number of covering array numbers are improved.

Original languageEnglish (US)
Pages (from-to)2137-2147
Number of pages11
JournalGraphs and Combinatorics
Volume31
Issue number6
DOIs
StatePublished - Jan 13 2015

Keywords

  • Augmentation
  • Covering array
  • Kruskal–Katona theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Augmentation of Covering Arrays of Strength Two'. Together they form a unique fingerprint.

  • Cite this