Name
Abstract | ||
|---|---|---|
In traditional Combinatorial Group Testing the problem is to identifyup to d defective items from a set of n items on the basis ofgroup tests. In this paper we describe a variant of the group testingproblem above, which we call parity group testing. The problem isto identify up to d defective items from a set of n items asin the classical group test problem. The main difference is thatwe check the parity of the defective items in a subset. The testcan be applied to an arbitrary subset of the n items with two possibleoutcomes. The test is positive if the number of defective items inthe subset is odd, otherwise it is negative. In this paper we extendHirschberg et al.'s method to the parity group testing scenario.
|
Year | DOI | Venue |
|---|---|---|
2015 | 10.14232/actacyb.22.2.2015.12 | Acta Cybern. |
Keywords | Field | DocType |
combinatorial group testing | Combinatorial group testing,Combinatorics,Algorithm,Parity (mathematics),Group testing,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 2 | 0324-721X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sándor Z. Kiss | 1 | 10 | 4.65 |
| Eva Hosszu | 2 | 11 | 3.29 |
| Lajos Rónyai | 3 | 397 | 52.05 |
| János Tapolcai | 4 | 364 | 41.42 |