The following pages link to (Q3469037):
Displaying 22 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Synthetic sequence design for signal location search (Q378252) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- Symmetric disjunctive list-decoding codes (Q510468) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- Non-adaptive group testing in the presence of errors (Q1281776) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Pooling spaces and non-adaptive pooling designs (Q1827741) (← links)
- Union-intersection-bounded families and their applications (Q2026353) (← links)
- Random and quasi-random designs in group testing (Q2156803) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Pharmaceutical Applications of a Multi-Stage Group Testing Method (Q5233886) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
- A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)
