2008/06/09 by Xianmin Ming, Ming, Xianmin, Jiansheng Yang +1
Computer Science · Mathematics · Social Sciences · #Agricultural and Environmental Management #FOS: Computer and information sciences #Information Theory (cs.IT) #Technology and Data Analysis #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0806.1397
arxiv created 2008/06/09 · openalex publication_date 2008/06/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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>m2>1 and 1≥ε≥ ε1(n, m), we get that the new bound is better. To ε-\bigtriangleup U(N; n, m) hash family, in the case of n>m>1 and 1≥ε≥ε3(n,m), the new bound is better. To ε-SU(N; n, m) hash family, in the case of n>2m>2 and 1≥ε≥ ε4(n, m), we get that the new bound is better.