Nonadaptive group testing with lies: probabilistic existence theorems
From MaRDI portal
(Redirected from Publication:984649)
Recommendations
- Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
- Probabilistic existence theorems in group testing
- Existence theorems for some group testing strategies
- The Capacity of Bernoulli Nonadaptive Group Testing
- On the structure of a class of sets useful in nonadaptive group testing
- A simple characterization of non-randomized admissible procedures in group testing
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
Cites work
- scientific article; zbMATH DE number 3831842 (Why is no real title available?)
- scientific article; zbMATH DE number 4057247 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Existence theorems for some group testing strategies
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Minimal 2-coverings of a finite affine space based on GF(2)
- On separating systems of a finite set
- On the Lambert \(w\) function
- On the theory of random search
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Probabilistic existence theorems in group testing
- Search
- Search with small sets in presence of a liar
- Some new factor screening designs using the search linear model
Cited in
(3)
This page was built for publication: Nonadaptive group testing with lies: probabilistic existence theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984649)