Skip to main content
Open Access Publications from the University of California

On the cutoff point for pairwise enabling in multiple access systems


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.430

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View