A simple proof is given of the best-known upper bound on the cardinality of a set of vectors of length t over an alphabet of size b , with the property that, for every subset of k vectors, there is a coordinate in which they all differ. This question is motivated by the study of perfect hash functions.
No takes yet. Share an insight, caveat, or question.
A. Nilli (1994) studied this question.