Premium
A combinatorial characterization of certain universal classes of hash functions
Author(s) -
van Trung Tran
Publication year - 1994
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.3180020306
Subject(s) - hash function , characterization (materials science) , mathematics , combinatorics , upper and lower bounds , perfect hash function , discrete mathematics , computer science , hash table , computer security , mathematical analysis , materials science , nanotechnology
A new lower bound on the size of ϵ‐almost strongly universal 2 classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU 2 classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom