Computer Science – Information Theory
Scientific paper
2010-10-03
Computer Science
Information Theory
Invited Paper in Proceedings of 48th Annual Allerton Conference on Communication, Control, and Computing, 2010
Scientific paper
The rapid development of derandomization theory, which is a fundamental area in theoretical computer science, has recently led to many surprising applications outside its initial intention. We will review some recent such developments related to combinatorial group testing. In its most basic setting, the aim of group testing is to identify a set of "positive" individuals in a population of items by taking groups of items and asking whether there is a positive in each group. In particular, we will discuss explicit constructions of optimal or nearly-optimal group testing schemes using "randomness-conducting" functions. Among such developments are constructions of error-correcting group testing schemes using randomness extractors and condensers, as well as threshold group testing schemes from lossless condensers.
No associations
LandOfFree
Derandomization and Group Testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Derandomization and Group Testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derandomization and Group Testing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512546