By Stefano Della Fiore and others

For fixed integers *b\geq k*, the problem of perfect *(b,k)*-hashing asks for the asymptotic growth of largest subsets of *\{1,2,\ldots,b\}^n* such that for any *k* distinct elements in the set, there is a coordinate where they all differ. An important asymptotic upper bound for general *b, k*, was derived by... Show more

January 26, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

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

Click on play to start listening