✦ LIBER ✦

Some recursive constructions for perfect hash families

✍ Scribed by M. Atici; S. S. Magliveras; D. R. Stinson; W.-D. Wei

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 452 KB
Volume: 4
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1996)4:5<353::aid-jcd4>3.0.co;2-e

No coin nor oath required. For personal study only.

✦ Synopsis

An (n, m, w)-perfect hash family is a set of functions F such that f : (1

📜 SIMILAR VOLUMES

Perfect Hash Families: Probabilistic Met

Perfect Hash Families: Probabilistic Methods and Explicit Constructions

✍ Simon R. Blackburn 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 113 KB

An (n, q, t)-perfect hash family of size s consists of a set V of order n, a set F of order q, and a sequence , 1 , , 2 , ..., , s of functions from V to F with the following property. For all t-subsets X V, there exists i # [1, 2, ..., s] such that , i is injective when restricted to X. An (n, q, t

Explicit Constructions of Perfect Hash F

Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields

✍ Huaxiong Wang; Chaoping Xing 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,

New constructions for perfect hash famil

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

✍ D. R. Stinson; R. Wei; L. Zhu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

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

Recursive constructions for difference m

Recursive constructions for difference matrices and relative difference families

✍ Marco Buratti 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n1 , n2 , . . . , nt) there exists a (G, p e , 1) difference matrix with e = Σ i n i m ax i n i . Also,

Existence question for difference famili

Existence question for difference families and construction of some new families

✍ Luis Martínez; Dragomir Z̆. Ðoković; Antonio Vera-López 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract We establish some properties of mixed difference families. We obtain some criteria for the existence of such families and a special kind of multipliers. Several methods are presented for the construction of difference families by using cyclotomy and genetic algorithms. © 2004 Wiley Peri