The following pages link to (Q4945068):
Displayed 13 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Almost cover-free codes (Q2364463) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- On optimal superimposed codes (Q4458733) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)