On the cutoff point for pairwise enabling in multiple access systems

Abstract

In [1], we showed that the minimum probability p^0 for which pairwise enabling is an optimal group testing algorithm under an unbounded Bernoulli arrival sequence model satisfies 0.43