Improving two recursive constructions for covering arrays
From MaRDI portal
Publication:2322060
DOI10.1080/15598608.2012.647489zbMath1418.05036OpenAlexW2011798520MaRDI QIDQ2322060
Junling Zhou, Charles J. Colbourn
Publication date: 27 August 2019
Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15598608.2012.647489
Related Items (4)
Strengthening hash families and compressive sensing ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Upper Bounds on the Size of Covering Arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Explicit constructions for perfect hash families
- Linear hash families and forbidden configurations
- Explicit construction of exponential sized families of k-independent sets
- Optimal linear perfect hash families
- Perfect hash families: Probabilistic methods and explicit constructions
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- A sequence approach to linear perfect hash families
- Geometric constructions of optimal linear perfect hash families
- On the state of strength-three covering arrays
- Optimal linear perfect hash families with small parameters
- Iterative Exhaustive Pattern Generation for Logic Testing
- A recursive construction for perfect hash families
- Randomized Postoptimization of Covering Arrays
- Perfect Hash Families: Constructions and Existence
- Products of mixed covering arrays of strength two
This page was built for publication: Improving two recursive constructions for covering arrays
