A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

DOI10.1016/j.tcs.2006.06.008zbMath1110.68166OpenAlexW2126750116MaRDI QIDQ860816

Philipp Woelfel

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.008

zbMATH Keywords

resolvable balanced incomplete block designsuniversal hashing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on universal classes of hash functions
• The computational complexity of universal hashing
• Universal classes of hash functions
• Bucket hashing and its application to fast message authentication
• Combinatorial techniques for universal hashing
• Universal hashing and authentication codes
• Universal hashing and geometric codes
• Flexible usage of redundancy in disk arrays
• Universal Hashing and Multiple Authentication
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Linear-Time Approximation Algorithms for the Max Cut Problem
• Dynamic Perfect Hashing: Upper and Lower Bounds
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• A combinatorial design approach to MAXCUT