Explicit Non-adaptive Combinatorial Group Testing Schemes

DOI10.1007/978-3-540-70575-8_61MaRDI QIDQ3521963zbMATH OpenOpenAlexFDO

Authors Ely Porat, Amir Rothschild

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2009/2241/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Optimal group testing
• Algorithms and Data Structures
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• An efficient algorithm for combinatorial group testing

Cited in

(23)

• Deterministic constructions of high-dimensional sets with small dispersion
• Erasure combinatorial batch codes based on nonadaptive group testing
• New combinatorial structures with applications to efficient group testing with inhibitors
• Non-adaptive complex group testing with multiple positive sets
• Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
• Combinatorial Group Testing for Corruption Localizing Hashing
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• Non-adaptive complex group testing with multiple positive sets
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Group Testing with Multiple Mutually-Obscuring Positives
• A new strongly competitive group testing algorithm with small sequentiality
• Almost separable matrices
• Binary representations of underdetermined data and superimposed codes
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• scientific article; zbMATH DE number 7650113 (Why is no real title available?)
• Simple Codes and Sparse Recovery with Fast Decoding
• Non-adaptive Group-Testing Aggregate MAC Scheme
• Group testing aggregate signatures with soundness
• Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
• Deterministic sparse Fourier transform with an _ guarantee
• Pattern matching with don't cares and few errors
• Nonadaptive group testing with lies: probabilistic existence theorems

This page was built for publication: Explicit Non-adaptive Combinatorial Group Testing Schemes

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