Skip to content

Strong converses for group testing in the finite blocklength regime

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)5923 - 5933
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number9
Early online date24 Apr 2017
DateSubmitted - 21 Sep 2015
DateAccepted/In press - 9 Apr 2017
DateE-pub ahead of print - 24 Apr 2017
DatePublished (current) - 21 Aug 2017


We prove new strong converse results in a variety of group testing settings, generalizing a result of Baldassini, Johnson and Aldridge. First, in the non-adaptive case, we mimic the hypothesis testing argument introduced in the finite blocklength channel coding regime by Polyanskiy, Poor and Verdu, and using joint source–channel coding arguments of Kostina and Verdu. In the adaptive case, we combine this approach with a novel model formulation based on causal probability and directed information theory. 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.

    Research areas

  • Group testing, Converse bounds, Finite block-length, Sparse models

Download statistics

No data available



  • Full-text PDF (accepted author manuscript)

    Rights statement: This is the author accepted manuscript (AAM). The final published version (version of record) is available online via IEEE at Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 619 KB, PDF document


View research connections

Related faculties, schools or groups