New upper bounds for $(b,k)$-hashing

Stefano Della Fiore, Simone Costa, Marco Dalai

For fixed integers $b\ge k$, the problem of perfect $(b,k)$-hashing asks for the asymptotic growth of largest subsets of $\{1,2,\dots ,b{\}}^n$ such that for any $k$ distinct elemen…