Optimal linear perfect hash families

DOI10.1006/jcta.1998.2876zbMath0914.68088OpenAlexW1987789009MaRDI QIDQ1269893

Simon R. Blackburn, Peter R. Wild

Publication date: 18 October 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ca676b173b6a437c899eb15515235c4c8a8c5e2d

zbMATH Keywords

perfect has families

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Anonymity in shared symmetric key primitives, A sequence approach to linear perfect hash families, Secret sharing schemes with partial broadcast channels, Improved bounds for separating hash families, Linear Time Constructions of Some $$d$$-Restriction Problems, A hierarchical framework for recovery in compressive sensing, Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings, Unnamed Item, A recursive construction for perfect hash families, On generalized separating hash families, Geometric constructions of optimal linear perfect hash families, A bound on the size of separating hash families, Explicit constructions of perfect hash families from algebraic curves over finite fields, Broadcast authentication for group communication, Explicit constructions for perfect hash families, Linear hash families and forbidden configurations, Improving two recursive constructions for covering arrays, Perfect hash families: Probabilistic methods and explicit constructions, Distributing the encryption and decryption of a block cipher

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit construction of exponential sized families of k-independent sets
• New bounds for perfect hashing via information theory
• Improved bounds for covering complete uniform hypergraphs
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Automorphisms of unitary block designs
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fredman–Komlós bounds and information theory
• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy