Abstract
In this paper, we consider a threshold group testing (TGT) problem in which there are two thresholds to determine the output result, i.e., positive or negative. We aim to find a lower bound for decoding defective samples out of a set of a large population. To this end, we use the Fano's inequality theorem in the information theory. We show that for highly successful decoding of smaller defective samples, a group matrix should be designed to be dense. In addition, we conclude that as a gap between two thresholds grows, a group matrix is required to be denser to find defective samples with only a small number of tests.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
