The Improvement of the Bound on Hash Family
Xianmin Ming, Jiansheng Yang

TL;DR
This paper improves the theoretical bounds on three types of hash families using the Singleton bound, providing tighter limits under specific parameter conditions.
Contribution
It introduces new, tighter bounds for three classes of hash families, enhancing the theoretical understanding of their limitations.
Findings
New bounds are better for $\epsilon-U(N; n, m)$ hash families when $n>m^2>1$.
Improved bounds for $\epsilon-igtriangleup U(N; n, m)$ hash families when $n>m>1$.
Enhanced bounds for $\epsilon-SU(N; n, m)$ hash families when $n>2^m>2$.
Abstract
In this paper, we study the bound on three kinds of hash family using the Singleton bound. To hash family, in the caes of and , we get that the new bound is better. To hash family, in the case of and , the new bound is better. To hash family, in the case of and , we get that the new bound is better.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAgricultural and Environmental Management · Technology and Data Analysis
