An interesting direction, uncovered by @LouisD's answer mentioning [EFF] (Erdős, Paul; Frankl, P.; Füredi, Z., Families of finite sets in which no set is covered by the union of (r) others, Isr. J. Math. 51, 79-89 (1985). ZBL0587.05021), is to find a family $V$ of $k$-subsets of a $n$-set $E$, such that no two elements in the family intersect in more than $t$ points. Then associating each subset to a taking, and each element of $E$ to a pool, we get a pooling design with detection capacity at least $\lceil \frac k t\rceil-1$ since it needs at least $\lceil \frac k t\rceil$ elements of the family to cover any other elements.
For this, one can use finite fields in a number of way, using for example the fact that two lines of a projective space over $\mathbb{F}_q$ intersect in at most $1$ points (this can be generalized to other dimensions).
Among the pretty effective pooling designs one can get this way, let us mention two that are not equivalent to previously described in the other anwsers.
1.1. Consider $E=\mathbb{F}_3^3$ and $V$ the set of its affine lines. Then we get $v=117$, $e=27$ and $c=2$.
1.2 Consider $E=\mathbb{P}^3\mathbb{F}_3^4$ and $V$ the set of its (projective) lines. Then we have $v=130$, $e=40$ and $c=2$.
Very high compression rates can be achieved with $2$-planes in $4$-dimensional spaces, but the detection capacity stays moderate and this seems only applicable in low prevalence. Low compression rates but high detection capacity are achieved by taking large $q$ and working in dimension $2$.
Edit. Removed another method, whose computations where way wrong.