By Topic

On the cutoff point for pairwise enabling in multiple access systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Molle, M. ; Comput. Syst. Res. Inst., Toronto Univ., Ont., Canada

Let p0 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⩽p0⩽0.568 for unbounded Bernoulli arrival sequences, based on the threshold probabilities at which certain triple enabling algorithms (operating with and without the aid of a helpful genie, respectively) become more efficient. By deriving constructive results using the powerful but seemingly nonconstructive upper-bounding technique introduced by N.A. Mikhailov and B.S. Tsybakov (1981), the author sharpens this result by proving that p0 ⩽0.5 for unbounded arrival sequences, and that p0≈0.545 in the finite arrival sequence model recently studied by F.K. Hwang and X.M. Chang (1987). The present results for unbounded arrival sequences also extend to the reservation schemes considered by Hwang and Chang, where it is now shown that 0.386⩽p0I⩽0.387 under the intermediate reservation model and 0.436⩽p0G⩽1/√3 under the Gudjohnsen reservation model, respectively

Published in:

Information Theory, IEEE Transactions on  (Volume:36 ,  Issue: 5 )