The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

The explicit construction of covering arrays arises in many disparate applications in which
factors or components interact. Despite this, current computational tools are effective only …

Linear Time Constructions of Some d-Restriction Problems Page 1 Linear Time Constructions of
Some d-Restriction Problems Nader H. Bshouty(B) Technion, Haifa, Israel …

Perfect hash families are often represented as combinatorial arrays encoding partitions of k
items into v classes, so that every t or fewer of the items are completely separated by at least …

Recursive constructions for covering arrays employ small ingredient covering arrays to build
large ones. At present the most effective methods are 'cut-and-paste'(or Roux-type) and …

The construction of many families of combinatorial objects remains a challenging problem. A
t-restriction is an array where a predicate is satisfied for every t columns; an example is a …

The classical orthogonal arrays over the finite field underlie a powerful construction of
perfect hash families. By forbidding certain sets of configurations from arising in these …

In this paper, we investigate some interesting connections between transversal designs and
perfect hash families. We introduce a class of transversal designs which can be used to …

A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of
order q consists of a set S={\phi_1, ...,\phi_s\} of linear functionals from V to F with the …

Abstract A linear $(q^ d, q, t) $-perfect hash family of size $ s $ in a vector space $ V $ of
order $ q^ d $ over a field $ F $ of order $ q $ consists of a set $\phi_1,\ldots,\phi_s $ of …