A combinatorial characterization of certain universal classes of hash functions

摘要

AbstractA new lower bound on the size of ϵ‐almost strongly universal2classes of hash functions has recently been obtained by Stinson 8. In this article we present a characterization of ϵ − ASU2classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994 John WileySon