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

DOI10.1016/J.TCS.2006.06.008MaRDI QIDQ860816zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Computing and Combinatorics
• Perfect hash families: Probabilistic methods and explicit constructions
• On a family of universal hash functions
• Perfect Hash Families: Constructions and Existence
• scientific article; zbMATH DE number 1418345
• A combinatorial characterization of certain universal classes of hash functions
• Related-key almost universal hash functions: definitions, constructions and applications
• Explicit constructions for perfect hash families
• Constructions and bounds for separating hash families
• On Universal Classes of Extremely Random Constant-Time Hash Functions

Cites work

• A combinatorial design approach to MAXCUT
• A note on universal classes of hash functions
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Bucket hashing and its application to fast message authentication
• Combinatorial techniques for universal hashing
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Flexible usage of redundancy in disk arrays
• scientific article; zbMATH DE number 1676651 (Why is no real title available?)
• scientific article; zbMATH DE number 1161253 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Linear-Time Approximation Algorithms for the Max Cut Problem
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• The computational complexity of universal hashing
• Universal classes of hash functions
• Universal hashing and authentication codes
• Universal hashing and geometric codes
• Universal hashing and multiple authentication

Cited in

(1)

• Computing and Combinatorics

This page was built for publication: A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860816)