3 Citations (Scopus)

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

Fingerprint

Covering Array
Augmentation
Binary

Keywords

  • Augmentation
  • Covering array
  • Kruskal–Katona theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Augmentation of Covering Arrays of Strength Two. / Colbourn, Charles.

In: Graphs and Combinatorics, Vol. 31, No. 6, 13.01.2015, p. 2137-2147.

Research output: Contribution to journalArticle

@article{c3ed5a7fb43842fb8b1cefa824024d67,
title = "Augmentation of Covering Arrays of Strength Two",
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.",
keywords = "Augmentation, Covering array, Kruskal–Katona theorem",
author = "Charles Colbourn",
year = "2015",
month = "1",
day = "13",
doi = "10.1007/s00373-014-1519-9",
language = "English (US)",
volume = "31",
pages = "2137--2147",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "6",

}

TY - JOUR

T1 - Augmentation of Covering Arrays of Strength Two

AU - Colbourn, Charles

PY - 2015/1/13

Y1 - 2015/1/13

N2 - 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.

AB - 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.

KW - Augmentation

KW - Covering array

KW - Kruskal–Katona theorem

UR - http://www.scopus.com/inward/record.url?scp=84946482457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946482457&partnerID=8YFLogxK

U2 - 10.1007/s00373-014-1519-9

DO - 10.1007/s00373-014-1519-9

M3 - Article

VL - 31

SP - 2137

EP - 2147

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 6

ER -