Pages that link to "Item:Q696905"
From MaRDI portal
The following pages link to Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905):
Displaying 37 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- Separating codes and a new combinatorial search model (Q619509) (← links)
- Extremal families containing no two sets and their union (Q763067) (← links)
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Pooling spaces associated with finite geometry (Q932830) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- A class of error-correcting pooling designs over complexes (Q987499) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Bounds on the rate of separating codes (Q1752294) (← 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)
- Almost cover-free codes (Q2364463) (← links)
- Hypothesis group testing for disjoint pairs (Q2426661) (← 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)
- Strict group testing and the set basis problem (Q2452424) (← 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)
- 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)
- Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
- On optimal superimposed codes (Q4458733) (← links)
- Threshold and Majority Group Testing (Q4915253) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- Asymptotic bounds for the rate of colored superimposed codes (Q5121240) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- Some new results on superimposed codes (Q5462393) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
