Mixed covering arrays of strength three with few factors

Charles Colbourn, Ce Shi, Chengmin Wang, Jie Yan

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Covering arrays with mixed alphabet sizes, or mixed covering arrays, are useful generalizations of covering arrays that are motivated by software and network testing. Suppose that there are k factors, and that the ith factor takes values or levels from a set Gi of size gi. A run is an assignment of an admissible level to each factor. A mixed covering array, MCA(N;t,k,g1g2...gk), is a collection of N runs such that for any t distinct factors, i1,i2,...,it, every t-tuple from Gi1×Gi2×. .×Git occurs in factors i1,i2,...,it in at least one of the N runs. When g=g1=g2=...=gk, an MCA(N;t,k,g1g2...gk) is a CA(N;t,k,g). The mixed covering array number, denoted by MCAN(t,k,g1g2...gk), is the minimum N for which an MCA(N;t,k,g1g2...gk) exists. In this paper, we focus on the constructions of mixed covering arrays of strength three. The numbers MCAN(3,k,g1g2...gk) are determined for all cases with k∈{3,4} and for most cases with k∈;{5,6}.

Original languageEnglish (US)
Pages (from-to)3640-3647
Number of pages8
JournalJournal of Statistical Planning and Inference
Volume141
Issue number11
DOIs
StatePublished - Nov 2011

Fingerprint

Covering Array
Testing
Factors
Assignment
Distinct
Software

Keywords

  • Covering array
  • Mixed covering array
  • Orthogonal array

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Statistics and Probability

Cite this

Mixed covering arrays of strength three with few factors. / Colbourn, Charles; Shi, Ce; Wang, Chengmin; Yan, Jie.

In: Journal of Statistical Planning and Inference, Vol. 141, No. 11, 11.2011, p. 3640-3647.

Research output: Contribution to journalArticle

Colbourn, Charles ; Shi, Ce ; Wang, Chengmin ; Yan, Jie. / Mixed covering arrays of strength three with few factors. In: Journal of Statistical Planning and Inference. 2011 ; Vol. 141, No. 11. pp. 3640-3647.
@article{c6b91372c2d04113b3534f509b09e68f,
title = "Mixed covering arrays of strength three with few factors",
abstract = "Covering arrays with mixed alphabet sizes, or mixed covering arrays, are useful generalizations of covering arrays that are motivated by software and network testing. Suppose that there are k factors, and that the ith factor takes values or levels from a set Gi of size gi. A run is an assignment of an admissible level to each factor. A mixed covering array, MCA(N;t,k,g1g2...gk), is a collection of N runs such that for any t distinct factors, i1,i2,...,it, every t-tuple from Gi1×Gi2×. .×Git occurs in factors i1,i2,...,it in at least one of the N runs. When g=g1=g2=...=gk, an MCA(N;t,k,g1g2...gk) is a CA(N;t,k,g). The mixed covering array number, denoted by MCAN(t,k,g1g2...gk), is the minimum N for which an MCA(N;t,k,g1g2...gk) exists. In this paper, we focus on the constructions of mixed covering arrays of strength three. The numbers MCAN(3,k,g1g2...gk) are determined for all cases with k∈{3,4} and for most cases with k∈;{5,6}.",
keywords = "Covering array, Mixed covering array, Orthogonal array",
author = "Charles Colbourn and Ce Shi and Chengmin Wang and Jie Yan",
year = "2011",
month = "11",
doi = "10.1016/j.jspi.2011.05.018",
language = "English (US)",
volume = "141",
pages = "3640--3647",
journal = "Journal of Statistical Planning and Inference",
issn = "0378-3758",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - Mixed covering arrays of strength three with few factors

AU - Colbourn, Charles

AU - Shi, Ce

AU - Wang, Chengmin

AU - Yan, Jie

PY - 2011/11

Y1 - 2011/11

N2 - Covering arrays with mixed alphabet sizes, or mixed covering arrays, are useful generalizations of covering arrays that are motivated by software and network testing. Suppose that there are k factors, and that the ith factor takes values or levels from a set Gi of size gi. A run is an assignment of an admissible level to each factor. A mixed covering array, MCA(N;t,k,g1g2...gk), is a collection of N runs such that for any t distinct factors, i1,i2,...,it, every t-tuple from Gi1×Gi2×. .×Git occurs in factors i1,i2,...,it in at least one of the N runs. When g=g1=g2=...=gk, an MCA(N;t,k,g1g2...gk) is a CA(N;t,k,g). The mixed covering array number, denoted by MCAN(t,k,g1g2...gk), is the minimum N for which an MCA(N;t,k,g1g2...gk) exists. In this paper, we focus on the constructions of mixed covering arrays of strength three. The numbers MCAN(3,k,g1g2...gk) are determined for all cases with k∈{3,4} and for most cases with k∈;{5,6}.

AB - Covering arrays with mixed alphabet sizes, or mixed covering arrays, are useful generalizations of covering arrays that are motivated by software and network testing. Suppose that there are k factors, and that the ith factor takes values or levels from a set Gi of size gi. A run is an assignment of an admissible level to each factor. A mixed covering array, MCA(N;t,k,g1g2...gk), is a collection of N runs such that for any t distinct factors, i1,i2,...,it, every t-tuple from Gi1×Gi2×. .×Git occurs in factors i1,i2,...,it in at least one of the N runs. When g=g1=g2=...=gk, an MCA(N;t,k,g1g2...gk) is a CA(N;t,k,g). The mixed covering array number, denoted by MCAN(t,k,g1g2...gk), is the minimum N for which an MCA(N;t,k,g1g2...gk) exists. In this paper, we focus on the constructions of mixed covering arrays of strength three. The numbers MCAN(3,k,g1g2...gk) are determined for all cases with k∈{3,4} and for most cases with k∈;{5,6}.

KW - Covering array

KW - Mixed covering array

KW - Orthogonal array

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

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

U2 - 10.1016/j.jspi.2011.05.018

DO - 10.1016/j.jspi.2011.05.018

M3 - Article

AN - SCOPUS:79959780043

VL - 141

SP - 3640

EP - 3647

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

SN - 0378-3758

IS - 11

ER -