An Efficient Algorithm for Group Testing with Runlength Constraints

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we provide an efficient algorithm to construct almost optimal $(k,n,d)$-superimposed codes with runlength constraints. A $(k,n,d)$-superimposed code of length $t$ is…