Non-Adaptive Group Testing and the Group Sum Design

The area of non-adaptive group testing is a well-sought topic in recent years. The general problem is - we have a large set of elements, N which contains some 'special items'. The (sub)set of special items is D. Our job is to precisely identify D. For this we can take tests on groups of elements of N (hence group testing), and for each test we get the answer whether there was at least one special element in the group. Our goal is to identify all the special elements in as few tests as possible. In the non-adaptive case we have to lay down the details of each test in advance and cannot change it on the fly as new data flows in. In our talk we will present (graphs of) existing best bounds for smaller parameters, and talk about possible improvements. After this intro part of the talk we will present our new design, the Group Sum - which improves already existing bounds for certain parameter range(s), discuss its potential and ways of possible future enhancements.

Event Topic

Discrete Applied Math Seminar