Non-uniform covering array with symmetric forbidden edge constraints
From MaRDI portal
Publication:5206931
Abstract: It has been conjectured that whenever an optimal covering array exists there is also a uniform covering array with the same parameters and this is true for all known optimal covering arrays. When used as a test suite, the application context may have pairs of parameters that must be avoided and Covering arrays avoiding forbidden edges (CAFE) are a generalization accommodating this requirement. We prove that there is an arc-transitive, highly symmetric constraint graph where the unique optimal covering array avoiding forbidden edges is not uniform. This does not refute the conjecture but it does show that placing even highly symmetric constraints on covering arrays can force non-uniformity of optimal arrays.
Recommendations
Cites work
- A survey of binary covering arrays
- Covering arrays avoiding forbidden edges
- Covering arrays on graphs
- Disproof of a conjecture on the existence of balanced optimal covering codes
- Families of \(k\)-independent sets
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- On optimal binary codes with unbalanced coordinates
- Orthogonal arrays. Theory and applications
- Software and hardware testing using combinatorial covering suites
- Two applications (for search theory and truth functions) of Sperner type theorems
This page was built for publication: Non-uniform covering array with symmetric forbidden edge constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206931)
