Covering Array Bounds Using Analytical Techniques

Ruyue Yuan, Zoe Koch, Anant Godbole

A $t$-covering array with entries from the alphabet $\mathcal{Q}=\{0,1,\dots ,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of…