## Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 223-239 |

Number of pages | 17 |

Journal | Graphs and Combinatorics |

Volume | 34 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2018 |

## Keywords

- Coverage
- Covering arrays
- Projective general linear group
- Software testing

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics