The Improvement of the Bound on Hash Family

الأصل · EN

In this paper, we study the bound on three kinds of hash family using the Singleton bound. To ε-U(N; n, m) hash family, in the caes of n>m²>1 and 1≥ε≥ ε₁(n, m), we get that the new bound is better. To ε- U(N; n, m) hash family, in the case of n>m>1 and 1≥ε≥ε₃(n,m), the new bound is better. To ε-SU(N; n, m) hash family, in the case of n>2ᵐ>2 and 1≥ε≥ ε₄(n, m), we get that the new bound is better.