On the cutoff point for pairwise enabling in multiple access systems

Let p/sup 0/ be the minimum Bernoulli probability for which pairwise enabling is an optimal group testing algorithm under a Bernoulli arrival sequence model. In a previous work, it was shown that 0.430>