Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
From MaRDI portal
Publication:520418
DOI10.1007/s10114-017-5684-7zbMath1359.05016OpenAlexW2560082630MaRDI QIDQ520418
Publication date: 3 April 2017
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-017-5684-7
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimum detecting arrays for independent interaction faults
- Optimal locating arrays for at most two faults
- Optimum mixed level detecting arrays
- The equivalence between optimal detecting arrays and super-simple OAs
- Roux-type constructions for covering arrays of strengths three and four
- Constructions of new orthogonal arrays and covering arrays of strength three
- Covering arrays of strength three
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
- Locating and detecting arrays for interaction faults
- Strength two covering arrays: existence tables and projection
- On (\(g\), 4; 1)-difference matrices
- On the state of strength-three covering arrays
- Compound Orthogonal Arrays
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
