Threshold and Majority Group Testing

DOI10.1007/978-3-642-36899-8_24zbMath1377.68222OpenAlexW1508093667MaRDI QIDQ4915253

Vladimir Lebedev, Christian Deppe, Rudolf Ahlswede

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_24

zbMATH Keywords

poolinggroup testingthreshold group testingseparating codescover-free codes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial codes (94B25)

Related Items (7)

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ An improved zig zag approach for competitive group testing ⋮ A class of asymptotically optimal group testing strategies to identify good items ⋮ Superimposed Codes and Threshold Group Testing ⋮ Randomized Post-optimization for t-Restrictions ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ A class of asymptotically optimal group screening strategies with limited item participation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding one of \(D\) defective elements in some group testing models
• Improved constructions for non-adaptive threshold group testing
• Separating codes and a new combinatorial search model
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Reconstruction of hidden graphs and threshold group testing
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model
• Nonadaptive algorithms for threshold group testing
• Key storage in secure networks
• Sets pooling designs
• Generalized cover-free families.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some new bounds for cover-free families
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Superimposed Codes and Threshold Group Testing
• Density-Based Group Testing
• Nonrandom binary superimposed codes
• Threshold Group Testing
• Guessing secrets

This page was built for publication: Threshold and Majority Group Testing