Explicit Non-adaptive Combinatorial Group Testing Schemes

DOI10.1007/978-3-540-70575-8_61zbMath1153.68558OpenAlexW1772667815MaRDI QIDQ3521963

Amir Rothschild, Ely Porat

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) Linear codes (general theory) (94B05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Bounds on codes (94B65)

Related Items (15)

Pattern matching with don't cares and few errors ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Simple Codes and Sparse Recovery with Fast Decoding ⋮ Group testing aggregate signatures with soundness ⋮ Unnamed Item ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Almost separable matrices ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Nonadaptive group testing with lies: probabilistic existence theorems ⋮ Unnamed Item

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