Efficiently decodable non-adaptive group testing
From MaRDI portal
Recommendations
- Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
- On almost disjunct matrices for group testing
- Noise-resilient group testing: limitations and constructions
- Nonadaptive algorithms for threshold group testing
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
Cited in
(31)- Noise-resilient group testing: limitations and constructions
- Separable collusion-secure multimedia codes
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Sublinear decoding schemes for non-adaptive group testing with inhibitors
- Erasure combinatorial batch codes based on nonadaptive group testing
- A high quartet distance construction
- Strongly separable matrices for nonadaptive combinatorial group testing
- Linear Time Constructions of Some d-Restriction Problems
- Non-adaptive complex group testing with multiple positive sets
- Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
- Noise-Resilient Group Testing: Limitations and Constructions
- Non-adaptive complex group testing with multiple positive sets
- On almost disjunct matrices for group testing
- A new strongly competitive group testing algorithm with small sequentiality
- Local list recovery of high-rate tensor codes and applications
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Almost optimal cover-free families
- Subquadratic non-adaptive threshold group testing
- scientific article; zbMATH DE number 7758311 (Why is no real title available?)
- scientific article; zbMATH DE number 7758315 (Why is no real title available?)
- Simple Codes and Sparse Recovery with Fast Decoding
- Non-adaptive Group-Testing Aggregate MAC Scheme
- Nearly optimal pseudorandomness from hardness
- A note on the \(k\)-restriction problem
- A survey of cover-free families: constructions, applications, and generalizations
- Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
- Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees
- Non-adaptive edge counting and sampling via bipartite independent set queries
- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices
- Near-optimal list-recovery of linear code families
- List-recovery of random linear codes over small fields
This page was built for publication: Efficiently decodable non-adaptive group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417695)
