New covering array numbers

Idelfonso Izquierdo-Marquez and Jose Torres-Jimenez

Applied Mathematics and Computation, 2019, vol. 353, issue C, 134-146

Abstract: A covering array CA(N; t, k, v) is an N × k array on v symbols such that each N × t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N; t, k, v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t, k, v). We prove that CA(N;t+1,k+1,v) can be obtained from the juxtaposition of v covering arrays CA(N0; t, k, v), …,CA(Nv−1;t,k,v), where N=∑i=0v−1Ni. Given this, we developed an algorithm that constructs all possible juxtapositions and determines the nonexistence of certain covering arrays which allow us to establish the new covering array numbers CAN(4,13,2)=32,CAN(5,8,2)=52,CAN(5,9,2)=54,CAN(5,14,2)=64, CAN(6, 15, 2) = 128, and CAN(7,16,2)=256. Additionally, the computational results are the improvement of the lower bounds of 13 covering array numbers.

Keywords: Covering array number; Juxtaposition of covering arrays; Non-isomorphic covering arrays (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319300864
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:353:y:2019:i:c:p:134-146

DOI: 10.1016/j.amc.2019.01.069

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().