A recursive construction for perfect hash families
A known recursive construction for perfect hash families multiplies the number of factors by q, where q is the largest prime power not exceeding the number of symbols. This is generalized to permit multiplication of the number of factors by powers of q; it is also improved upon by restricting the st...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2009-12-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/JMC.2009.018 |
| Summary: | A known recursive construction for perfect hash families multiplies the number of factors by q, where q is the largest prime power not exceeding the number of symbols. This is generalized to permit multiplication of the number of factors by powers of q; it is also improved upon by restricting the structure of the ingredient designs. For a perfect hash family of strength t, it may be possible to order its rows so that, for each , the first Ni rows form a perfect hash family of strength . This ‘matroshka’ ordering underlies a sometimes substantial reduction in the number of rows generated by the recursive construction. Perfect hash families with useful matroshka orderings are generated using linear orthogonal arrays, and with an effective one-row-at-a-time greedy algorithm. |
|---|---|
| ISSN: | 1862-2976 1862-2984 |