Almost Optimal Cover-Free Families

Nader H. Bshouty, Ariel Gabizon

Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of…