1 research outputs found
Threshold Decoding for Disjunctive Group Testing
Let , be integers and a complex electronic circuit of
size is said to be an -active, , and can work as a system
block if not more than elements of the circuit are defective. Otherwise,
the circuit is said to be an -defective and should be replaced by a similar
-active circuit. Suppose that there exists a possibility to run
non-adaptive group tests to check the -activity of the circuit. As usual, we
say that a (disjunctive) group test yields the positive response if the group
contains at least one defective element. Along with the conventional decoding
algorithm based on disjunctive -codes, we consider a threshold decision rule
with the minimal possible decoding complexity, which is based on the simple
comparison of a fixed threshold , , with the number of
positive responses , . For the both of decoding algorithms we
discuss upper bounds on the -level of significance of the statistical
test for the null hypothesis \left\{ H_0 \,:\, \text{the circuit is
s-active} \right\} verse the alternative hypothesis \left\{ H_1 \,:\,
\text{the circuit is s-defective} \right\}.Comment: ACCT 2016, 6 page