Augmentation of Covering Arrays of Strength Two

Charles Colbourn

doi:10.1007/s00373-014-1519-9

Augmentation of Covering Arrays of Strength Two

Charles Colbourn

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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 language	English (US)
Pages (from-to)	2137-2147
Number of pages	11
Journal	Graphs and Combinatorics
Volume	31
Issue number	6
DOIs	https://doi.org/10.1007/s00373-014-1519-9
State	Published - Jan 13 2015

Keywords

Augmentation
Covering array
Kruskal–Katona theorem

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Theoretical Computer Science

Access to Document

10.1007/s00373-014-1519-9

Cite this

@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 = jan,

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

AN - SCOPUS:84946482457

SN - 0911-0119

VL - 31

SP - 2137

EP - 2147

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 6

ER -

Augmentation of Covering Arrays of Strength Two

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this