New combinatorial designs and their applications to group testing

DOI10.1016/0378-3758(84)90058-2zbMath0571.62062OpenAlexW2077263982MaRDI QIDQ1061433

K. A. Bush, H. Pesotan, Damaraju Raghavarao, Walter T. Federer

Publication date: 1984

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/32792

zbMATH Keywords

classificationcombinatorial designsBIBgroup testing experimentsPBIBt complete designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Design of statistical experiments (62K99)

Related Items (8)

SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices ⋮ Unnamed Item ⋮ Generalized cover-free families. ⋮ Some new bounds for cover-free families ⋮ Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ Improved bounds for group testing designs

Cites Work

• Finding a Single Defective in Binomial Group-Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New combinatorial designs and their applications to group testing