Superimposed Codes and Threshold Group Testing
DOI10.1007/978-3-642-36899-8_25zbMath1309.94185arXiv1401.7485OpenAlexW1596897150MaRDI QIDQ4915254
Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir Lebedev
Publication date: 9 April 2013
Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.7485
screening experimentsgroup testingsuperimposed codessearch designsrate of codesbounds on the ratecompressed genotypingrate of designsshortened RC-codethreshold search designs
General biostatistics (92B15) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Information theory (general) (94A15)
Related Items (3)
Cites Work
- A Mathematical Theory of Communication
- 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
- Nonadaptive algorithms for threshold group testing
- On the optimality of trivial \((w,r)\)-cover-free codes
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- On optimal superimposed codes
- New constructions of superimposed codes
- Threshold and Majority Group Testing
- Compressed Genotyping
- Nonrandom binary superimposed codes
- Threshold Group Testing
- Optimal superimposed codes and designs for Renyi's search model
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Superimposed Codes and Threshold Group Testing
