On a parity based group testing algorithm

Kiss Sándor Z. and Hosszu Éva and Rónyai Lajos and Tapolcai János: On a parity based group testing algorithm. In: Acta cybernetica, (22) 2. pp. 423-433. (2015)

[thumbnail of actacyb_22_2_2015_12.pdf]
Cikk, tanulmány, mű

Download (383kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2015
Volume: 22
Number: 2
ISSN: 0324-721X
Page Range: pp. 423-433
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38540/
DOI: 10.14232/actacyb.22.2.2015.12
Uncontrolled Keywords: Algoritmus, Számítástechnika
Additional Information: Bibliogr.: p. 431-433. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 17. 10:36
Last Modified: 2022. Jun. 20. 10:51
URI: http://acta.bibl.u-szeged.hu/id/eprint/36264

Actions (login required)

View Item View Item