✦ LIBER ✦

New constructions for perfect hash families and related structures using combinatorial designs and codes

✍ Scribed by D. R. Stinson; R. Wei; L. Zhu

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 141 KB
Volume: 8
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(2000)8:3<189::aid-jcd4>3.0.co;2-a

No coin nor oath required. For personal study only.

✦ Synopsis

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 ef®cient 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.