Premium
New constructions for perfect hash families and related structures using combinatorial designs and codes
Author(s) -
Stinson D. R.,
Wei R.,
Zhu L.
Publication year - 2000
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/(sici)1520-6610(2000)8:3<189::aid-jcd4>3.0.co;2-a
Subject(s) - combinatorial design , orthogonal array , hash function , mathematics , perfect hash function , combinatorics , cover (algebra) , discrete mathematics , theoretical computer science , algorithm , computer science , cryptography , cryptographic hash function , statistics , mechanical engineering , computer security , taguchi methods , engineering
In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei [3]. Using similar methods, we also obtain efficient constructions for separating hash families which result in improved existence results for structures such as separating systems, key distribution patterns, group testing algorithms, cover‐free families and secure frameproof codes. © 2000 John Wiley & Sons, Inc. J Combin Designs 8:189–200, 2000