Application of cover-free codes and combinatorial designs to two-stage testing.
From MaRDI portal
Publication:1811089
DOI10.1016/S0166-218X(02)00433-XzbMATH Open1043.05013OpenAlexW1993446088MaRDI QIDQ1811089FDOQ1811089
Authors: Toby Berger, Vladimir Levenshtein
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00433-x
Recommendations
Combinatorial aspects of block designs (05B05) Applications of design theory to circuits and networks (94C30)
Cites Work
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal pooling designs with error detection
- Asymptotic efficiency of two-stage disjunctive testing
- Upper bounds for constant-weight codes
Cited In (1)
This page was built for publication: Application of cover-free codes and combinatorial designs to two-stage testing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811089)