Superimposed codes and threshold group testing

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

D’yachkov, A., Rykov, V., Deppe, C., & Lebedev, V. (2013). Superimposed codes and threshold group testing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 509–533). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free