The Improvement of the Bound on Hash Family

Details The Improvement of the Bound on Hash Family The Improvement of the Bound on Hash Family

2008-06-09

arxiv.org/abs/0806.1397v1

Computer Science

Information Theory

Scientific paper

In this paper, we study the bound on three kinds of hash family using the Singleton bound. To $\epsilon-U(N; n, m)$ hash family, in the caes of $n>m^2>1$ and $1\geq\epsilon\geq \epsilon_1(n, m)$, we get that the new bound is better. To $\epsilon-\bigtriangleup U(N; n, m)$ hash family, in the case of $n>m>1$ and $1\geq\epsilon\geq\epsilon_3(n,m)$, the new bound is better. To $\epsilon-SU(N; n, m)$ hash family, in the case of $n>2^m>2$ and $1\geq\epsilon\geq \epsilon_4(n, m)$, we get that the new bound is better.

Affiliated with

Also associated with

No associations

Rating

The Improvement of the Bound on Hash Family does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Improvement of the Bound on Hash Family, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Improvement of the Bound on Hash Family will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400536