t-Covering Arrays: Upper Bounds and Poisson Approximations

DOI10.1017/S0963548300001905zbMath0865.60008MaRDI QIDQ4715260

Rachel A. Sunley, Anant P. Godbole, Daphne E. Skipper

Publication date: 16 December 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

Poisson approximationStein-Chen method\(t\)-covering array

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items

On a combinatorial framework for fault characterization, Roux-type constructions for covering arrays of strengths three and four, Binary Covering Arrays and Existentially Closed Graphs, Locating and detecting arrays for interaction faults, Asymptotic and constructive methods for covering perfect hash families and covering arrays, The Lovász local lemma and variable strength covering arrays, Strength two covering arrays: existence tables and projection, Partial covering arrays and a generalized Erdös-Ko-Rado property, Randomized post-optimization of covering arrays, Covering arrays from cyclotomy, Consecutive covering arrays and a new randomness test, Mixed optimization combinatorial method for constructing covering arrays, Partial covering arrays: algorithms and asymptotics, Cost-efficient mixed-level covering designs for testing experiments, Arrays for combinatorial interaction testing: a review on constructive approaches, Covering arrays of higher strength from permutation vectors, A survey of methods for constructing covering arrays, Sign-balanced covering matrices, Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma, Upper Bounds on the Size of Covering Arrays, Binary consecutive covering arrays

Cites Work

• Existence of submatrices with all possible columns
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Covering arrays and intersecting codes