Sign-balanced covering matrices

DOI10.1016/S0012-365X(98)00122-8zbMath0955.05020OpenAlexW2011359765MaRDI QIDQ1584386

Anant P. Godbole, Laura K. Potter, Erik Jonathan Sandquist

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00122-8

zbMATH Keywords

probability distributionPoisson approximationdifference matrixprobabilistic methodsLovász local lemmarandom arraysign-balanced matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Existence of submatrices with all possible columns
• On difference matrices, resolvable transversal designs and generalized Hadamard matrices
• Orthogonal arrays. Theory and applications
• Random covering designs
• Imperfections in Random Tournaments
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes
• Orthogonal Arrays of Strength two and three

This page was built for publication: Sign-balanced covering matrices