Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964)

Covering arrays can be constructed with the assistance of perfect and distributing hash families, e.g., [\textit{J.\ Bierbrauer} and \textit{H.\ Schellwat}, ``Almost independent and weakly biased arrays: efficient constructions and cryptologic applications,'' Lect. Notes Comput. Sci. 1880, 533--543 (2000; Zbl 0995.94552)] and [\textit{C.\ J.\ Colbourn}, ``Distributing hash families and covering arrays,'' J.\ Combin.\ Inf.\ Syst.\ Sci. 34, 113--126 (2009)]. This method of constructing covering arrays can be improved by considering \textit{heterogeneous} hash families, e.g., [\textit{C.\ J.\ Colbourn} and \textit{J.\ Torres-Jiménez}, ``Heterogeneous hash families and covering arrays,'' Contemp.\ Math. 523, 3--15 (2010; Zbl 1226.05061)]. In the present article the author considers the construction of distributing heterogeneous hash families via associated transversal designs. In particular, the idea seems to be to puncture a given transversal design using a distinguished point set called a \textit{thwart}. The main results appear in Section 4, where the author gives results on the existence of thwarts in certain types of transversal designs of strength two, describes the consequences for construction of associated heterogeneous hash families, and poses open questions about thwart analogs for transversal designs of higher strength.