Lower bounds for cover-free families

zbMath1339.05030arXiv1502.03578MaRDI QIDQ2629487

Ali Z. Abdi, Nader H. Bshouty

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03578

zbMATH Keywords

lower boundcover-free family

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Non-adaptive Learning of a Hidden Hypergraph

Cites Work

• Unnamed Item
• On the upper bound of the size of the \(r\)-cover-free families
• On a bound of cover-free families
• On \(r\)-cover-free families
• Some new bounds for cover-free families
• Bounds on the rate of disjunctive codes
• Learning a Hidden Subgraph
• Nonrandom binary superimposed codes

This page was built for publication: Lower bounds for cover-free families