On the structure of a class of sets useful in nonadaptive group testing

DOI10.1016/0378-3758(94)90112-0zbMath0797.62068OpenAlexW1980807028MaRDI QIDQ1330209

Farok Vakil, Milton Parnes

Publication date: 12 July 1994

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

Full work available at URL: https://doi.org/10.1016/0378-3758(94)90112-0

zbMATH Keywords

identificationupper boundgroup divisible designsdefectivenonadaptive group testingcombinatorial extremal problems

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Applications of statistics in engineering and industry; control charts (62P30) Combinatorial aspects of block designs (05B05)

Related Items (1)

Polygonal designs: Some existence and non-existence results

Cites Work

• Families of finite sets in which no set is covered by the union of \(r\) others
• A new class of group divisible designs with block size three
• Some optimum non-adaptive hypergeometric group testing designs for identifying two defectives
• Non-adaptive hypergeombtric group testing designs for identifying at most two defectives
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the structure of a class of sets useful in nonadaptive group testing