SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing Based on Sparse-Graph Codes

摘要

Group testing is the problem of identifying K defective items among n items by pooling groups of items. In this paper, we design group testing algorithms for approximate recovery with order-optimal sample complexity by leveraging design and analysis tools