New Lower Bounds for Weak Superimposed Codes
A new general lower bound on the largest code rate of weak superimposed codes for all integers is derived by improving the best known lower bound on the largest asymptotic code rate of weak <inline-formula><tex-math notation="LaTeX">$(t,T)$</tex-math></inline-formula> by the Lovász local lemma.