Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes

DOI10.1109/TIT.2006.881740zbMath1320.94056OpenAlexW2143609028MaRDI QIDQ3547916

Annalisa De Bonis, Ugo Vaccaro

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.881740

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Theory of questionnaires (94A50)

Related Items (12)

2-Cancellative Hypergraphs and Codes ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Uniform hypergraphs containing no grids ⋮ On the complexity of neighbourhood learning in radio networks ⋮ An improved zig zag approach for competitive group testing ⋮ A class of asymptotically optimal group testing strategies to identify good items ⋮ Superimposed Codes and Threshold Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ Information dissemination in wireless ad-hoc networks under the weighted-TIM framework ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions ⋮ A class of asymptotically optimal group screening strategies with limited item participation

This page was built for publication: Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes