Matthew Aldridge, Oliver Johnson and Jonathan Scarlett (2019), "Group Testing: An Information Theory Perspective", Foundations and TrendsĀ® in Communications and Information Theory: Vol. 15: No. 3-4, pp 196-392. http://dx.doi.org/10.1561/0100000099

© 2019 M. Aldridge, O. Johnson and J. Scarlett

Download article
**In this article:**

1. Introduction to Group Testing

2. Algorithms for Noiseless Group Testing

3. Algorithms for Noisy Group Testing

4. Information-Theoretic Limits

5. Other Topics in Group Testing

6. Conclusions and Open Problems

Acknowledgements

References

The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no defectives. This is a sparse inference problem with a combinatorial flavour, with applications in medical testing, biology, telecommunications, information technology, data science, and more. In this monograph, we survey recent developments in the group testing problem from an information-theoretic perspective. We cover several related developments: efficient algorithms with practical storage and computation requirements, achievability bounds for optimal decoding methods, and algorithm-independent converse bounds. We assess the theoretical guarantees not only in terms of scaling laws, but also in terms of the constant factors, leading to the notion of the rate of group testing, indicating the amount of information learned per test. Considering both noiseless and noisy settings, we identify several regimes where existing algorithms are provably optimal or near-optimal, as well as regimes where there remains greater potential for improvement. In addition, we survey results concerning a number of variations on the standard group testing problem, including partial recovery criteria, adaptive algorithms with a limited number of stages, constrained test designs, and sublineartime algorithms.

208 pp. $99.00

Buy book (pb)
208 pp. $280.00

Buy E-book (.pdf)
1. Introduction to Group Testing

2. Algorithms for Noiseless Group Testing

3. Algorithms for Noisy Group Testing

4. Information-Theoretic Limits

5. Other Topics in Group Testing

6. Conclusions and Open Problems

Acknowledgements

References

Group testing emerged as an area for research from the need for the US Government to screen recruits in the second world war for syphilis. Obviously rather than testing each recruit, a more efficient method involving the minimal number of tests was required. The central problem of group testing is thus: Given a number of items and a number of defectives, how many tests are required to accurately discover the defective items, and how can this be achieved? Group testing has since found applications in medical testing, biology, telecommunications, information technology, data science, and more.

The focus of this survey is on the non-adaptive setting of group testing. In this setting, the test pools are designed in advance enabling them to be implemented in parallel. The survey gives a comprehensive and thorough treatment of the subject from an information theoretic perspective. It covers several related developments: efficient algorithms with practical storage and computation requirements, achievability bounds for optimal decoding methods, and algorithm-independent converse bounds. It assesses the theoretical guarantees not only in terms of scaling laws, but also in terms of the constant factors, leading to the notion of the rate of group testing, indicating the amount of information learned per test. Considering both noiseless and noisy settings, it identifies several regimes where existing algorithms are provably optimal or near-optimal, as well as regimes where there remains greater potential for improvement.

This monograph is an accessible treatment of an important topic for researchers and students in Information Theory.