Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

In this paper, we study bounds on the minimum length of $(k,n,d)$-superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with…