On a bound of cover-free families

DOI10.1023/B:DESI.0000029231.44423.43zbMath1046.05019OpenAlexW2023171134MaRDI QIDQ1877363

Xin Rong Ma, Rui Zhong Wei

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.0000029231.44423.43

zbMATH Keywords

cover-free familiessuperimposed codesStirling formula

Mathematics Subject Classification ID

Extremal set theory (05D05) Other designs, configurations (05B30) Asymptotic enumeration (05A16)

Related Items (5)

Lower bounds for cover-free families ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Some new bounds for cover-free families through biclique covers ⋮ Non-adaptive Learning of a Hidden Hypergraph

This page was built for publication: On a bound of cover-free families