Strong converses for group testing from finite blocklength results
From MaRDI portal
Publication:4589415
DOI10.1109/TIT.2017.2697358zbMATH Open1374.94853DBLPjournals/tit/Johnson17arXiv1509.06188OpenAlexW3122789203WikidataQ60522081 ScholiaQ60522081MaRDI QIDQ4589415FDOQ4589415
Publication date: 10 November 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We prove new strong converse results in a variety of group testing settings, generalizing a result of Baldassini, Johnson and Aldridge. These results are proved by two distinct approaches, corresponding to the non-adaptive and adaptive cases. In the non-adaptive case, we mimic the hypothesis testing argument introduced in the finite blocklength channel coding regime by Polyanskiy, Poor and Verd'{u}. In the adaptive case, we combine a formulation based on directed information theory with ideas of Kemperman, Kesten and Wolfowitz from the problem of channel coding with feedback. In both cases, we prove results which are valid for finite sized problems, and imply capacity results in the asymptotic regime. These results are illustrated graphically for a range of models.
Full work available at URL: https://arxiv.org/abs/1509.06188
Cited In (1)
This page was built for publication: Strong converses for group testing from finite blocklength results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589415)
