Improved Bounds for (b,k)-hashing

For fixed integers b\geq k, a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with n, of the largest set for which a (b, k)-hash family of n functions exists. Equivalently, determining the asymptotic growth of a largest subset of \{1,2,\ldots,b\}^n such... Show more