t-Covering Arrays: Upper Bounds and Poisson Approximations

DOI10.1017/S0963548300001905MaRDI QIDQ4715260zbMATH OpenFDO

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

Publication date 16 December 1996

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

Full work available at URL https://doi.org/10.1017/S0963548300001905

zbMATH Keywords

\(t\)-covering arrayPoisson approximationStein-Chen method

Mathematics Subject Classification ID

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

Recommendations

• Covering array bounds using analytical techniques
• t-covering arrays generated by a tiling probability model
• scientific article; zbMATH DE number 7264182
• Upper bounds on the size of covering arrays
• Small arrays of maximum coverage

Cites work

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

Cited in

(26)

• Sign-balanced covering matrices
• On a combinatorial framework for fault characterization
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• The Lovász local lemma and variable strength covering arrays
• Randomized post-optimization of covering arrays
• Mixed optimization combinatorial method for constructing covering arrays
• Consecutive covering arrays and a new randomness test
• Cost-efficient mixed-level covering designs for testing experiments
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• Locating and detecting arrays for interaction faults
• Strength two covering arrays: existence tables and projection
• Binary consecutive covering arrays
• Partial covering arrays and a generalized Erdős-Ko-Rado property
• Structures and lower bounds for binary covering arrays
• Small arrays of maximum coverage
• scientific article; zbMATH DE number 7264182 (Why is no real title available?)
• Covering array bounds using analytical techniques
• Upper bounds on the size of covering arrays
• Binary Covering Arrays and Existentially Closed Graphs
• t-covering arrays generated by a tiling probability model
• Covering arrays of higher strength from permutation vectors
• Maximum shattering
• A survey of methods for constructing covering arrays
• Roux-type constructions for covering arrays of strengths three and four
• Covering arrays from cyclotomy

This page was built for publication: t-Covering Arrays: Upper Bounds and Poisson Approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715260)