The following pages link to (Q3798601):
Displaying 11 items.
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
