The Lovász local lemma and its applications to some combinatorial arrays

DOI10.1023/B:DESI.0000029217.97956.26zbMath1046.05080OpenAlexW2024356427WikidataQ124820281 ScholiaQ124820281MaRDI QIDQ1877346

Dameng Deng, Rui Zhong Wei, Douglas R. Stinson

Publication date: 16 August 2004

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:desi.0000029217.97956.26

zbMATH Keywords

probabilistic methodLovász local lemmacombinatorial array

Mathematics Subject Classification ID

Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (5)

Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Strengthening hash families and compressive sensing ⋮ A hierarchical framework for recovery in compressive sensing ⋮ An estimate for the probability of dependent events ⋮ Algorithmic methods for covering arrays of higher index

This page was built for publication: The Lovász local lemma and its applications to some combinatorial arrays