TY - JOUR

T1 - Improved Strength Four Covering Arrays with Three Symbols

AU - Maity, Soumen

AU - Akhtar, Yasmeen

AU - Chandrasekharan, Reshma C.

AU - Colbourn, Charles

N1 - Funding Information:
Acknowledgements The second author gratefully acknowledges support from the Council of Scientific and Industrial Research (CSIR), India, during the work under CSIR senior research fellow scheme. The fourth author’s research was supported in part by the National Science Foundation under Grant No. 1421058.
Publisher Copyright:
© 2017, Springer Japan KK, part of Springer Nature.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a k× n array on g symbols such that every t× n sub-array contains every t× 1 column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array A is the number of distinct t-tuples contained in the column vectors of A divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100%. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.

AB - A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a k× n array on g symbols such that every t× n sub-array contains every t× 1 column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array A is the number of distinct t-tuples contained in the column vectors of A divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100%. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.

KW - Coverage

KW - Covering arrays

KW - Projective general linear group

KW - Software testing

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

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

U2 - 10.1007/s00373-017-1861-9

DO - 10.1007/s00373-017-1861-9

M3 - Article

AN - SCOPUS:85038096110

VL - 34

SP - 223

EP - 239

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -