Pages that link to "Item:Q1976329"

The following pages link to Some new bounds for cover-free families (Q1976329):

Displaying 31 items.

• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• Separating codes and a new combinatorial search model (Q619509) (← links)
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
• Generalised cumulative arrays in secret sharing (Q851749) (← links)
• Secret sharing schemes with partial broadcast channels (Q851779) (← links)
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
• Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
• Generalized cover-free families. (Q1428544) (← links)
• Constructions for key distribution patterns (Q1692698) (← links)
• Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
• Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
• A group testing method for finding patterns in data (Q1885819) (← links)
• Bounds on the rate of disjunctive codes (Q2262991) (← links)
• A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)
• New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
• A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
• Transport schemes for topology-transparent scheduling (Q2471060) (← links)
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
• A classification of the structures of some Sperner families and superimposed codes (Q2502898) (← links)
• Lower bounds for cover-free families (Q2629487) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• Threshold and Majority Group Testing (Q4915253) (← links)
• Group Testing with Multiple Mutually-Obscuring Positives (Q4915257) (← links)
• (Q5005098) (← links)
• Asymptotic bounds for the rate of colored superimposed codes (Q5121240) (← links)
• Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
• Almost Optimal Cover-Free Families (Q5283363) (← links)
• Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
• A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)