On a Parity Based Group Testing Algorithm

Abstract

In traditional Combinatorial Group Testing the problem is to identify up to d defective items from a set of n items on the basis of group tests. In this paper we describe a variant of the group testing problem above, which we call parity group testing. The problem is to identify up to d defective items from a set of n items as in the classical group test problem. The main difference is that we check the parity of the defective items in a subset. The test can be applied to an arbitrary subset of the n items with two possible outcomes. The test is positive if the number of defective items in the subset is odd, otherwise it is negative. In this paper we extend Hirschberg et al.’s method to the parity group testing scenario.

DOI: 10.14232/actacyb.22.2.2015.12

Cite this paper

@article{Kiss2015OnAP, title={On a Parity Based Group Testing Algorithm}, author={S{\'a}ndor Z. Kiss and {\'E}va Hosszu and Lajos R{\'o}nyai and J{\'a}nos Tapolcai}, journal={Acta Cybern.}, year={2015}, volume={22}, pages={423-433} }