Let V be a set of order n and let F be a set of order q. A set S [,: V Γ F ] of functions from V to F is an (n, q, t)-perfect hash family if for all X V with |X | =t, there exists , # S which is injective when restricted to X. Perfect hash families arise in compiler design, in circuit complexity the
Optimal linear perfect hash families with small parameters
β Scribed by S. G. Barwick; Wen-Ai Jackson; Catherine T. Quinn
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 146 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A linear (q^d^, q, t)βperfect hash family of size s consists of a vector space V of order q^d^ over a field F of order q and a sequence Ο~1~,β¦,Ο~s~ of linear functions from V to F with the following property: for all t subsets X β V, there exists i β {1,Β·,s} such that Ο~i~ is injective when restricted to F. A linear (q^d^, q, t)βperfect hash family of minimal size d( β 1) is said to be optimal. In this paper, we prove that optimal linear (q^2^, q, 4)βperfect hash families exist only for qβ=β11 and for all prime powers q > 13 and we give constructions for these values of q. Β© 2004 Wiley Periodicals, Inc. J Comb Designs 12: 311β324, 2004
π SIMILAR VOLUMES
## Abstract Optimal **(__v__, 4,2,1)** optical orthogonal codes (OOCs) with **__v__**β©½**75** and **__v__**β **71** are classified up to isomorphism. One **(__v__, 4,2,1)** OOC is presented for all **__v__**β©½**181**, for which an optimal OOC exists. Copyright Β© 2011 Wiley Periodicals, Inc. J Combin D