Explicit Nonadaptive Combinatorial Group Testing Schemes

DOI10.1109/TIT.2011.2163296MaRDI QIDQ5272213zbMATH OpenOpenAlexFDO

Authors Ely Porat, Amir Rothschild

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2011.2163296

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
• scientific article; zbMATH DE number 823957
• On the structure of a class of sets useful in nonadaptive group testing
• An efficient algorithm for combinatorial group testing
• Efficiently decodable non-adaptive group testing
• Nonadaptive algorithms for threshold group testing
• Strongly separable matrices for nonadaptive combinatorial group testing
• Non-adaptive group testing on graphs

Cited in

(37)

• Nonadaptive algorithms for threshold group testing
• Structure-aware combinatorial group testing: a new method for pandemic screening
• Real-valued group testing for quantitative molecular assays
• Modification tolerant signature schemes: location and correction
• Nested cover-free families for unbounded fault-tolerant aggregate signatures
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Sampling schemes and recovery algorithms for functions of few coordinate variables
• Locating modifications in signed data for partial data integrity
• Erasure combinatorial batch codes based on nonadaptive group testing
• New combinatorial structures with applications to efficient group testing with inhibitors
• Exact learning from an honest teacher that answers membership queries
• Deterministic non-adaptive contention resolution on a shared channel
• Linear Time Constructions of Some d-Restriction Problems
• -almost selectors and their applications
• Combinatorial Group Testing for Corruption Localizing Hashing
• Bounds for the number of tests in non-adaptive randomized algorithms for group testing
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• Boolean tensor decomposition for conjunctive queries with negation
• Sparse Combinatorial Group Testing
• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• Almost optimal cover-free families
• Subquadratic non-adaptive threshold group testing
• Optimal channel utilization with limited feedback
• The design of (almost) disjunct matrices by evolutionary algorithms
• scientific article; zbMATH DE number 7758315 (Why is no real title available?)
• Non-adaptive Group-Testing Aggregate MAC Scheme
• Bounds and algorithms for generalized superimposed codes
• On detecting some defective items in group testing
• A survey of cover-free families: constructions, applications, and generalizations
• Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees
• Constructions of optimal sparse r-disjunct matrices via packings
• Fast decoding of group testing results from Reed-Solomon d-disjunct matrices
• On detecting some defective items in group testing
• Cover-free families on hypergraphs and combinatorial group testing
• Ultra-resilient superimposed codes: near-optimal construction and applications
• On the complexity of neighbourhood learning in radio networks

This page was built for publication: Explicit Nonadaptive Combinatorial Group Testing Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272213)