Some intriguing upper bounds for separating hash families

DOI10.1007/S11425-017-9378-YzbMath1491.05110arXiv1707.01758OpenAlexW2962875875WikidataQ129249149 ScholiaQ129249149MaRDI QIDQ1729948

Xin Wang, Gennian Ge, Chong Shangguan

Publication date: 7 March 2019

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01758

zbMATH Keywords

probabilistic methodgraph removal lemmaJohnson-type recursive boundseparating hash families

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial codes (94B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Constructions and bounds for separating hash families ⋮ Distributing hash families with few rows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for separating hash families
• Cover-free codes and separating system codes
• Constructions and bounds for separating hash families
• On tight bounds for binary frameproof codes
• Perfect hash families of strength three with three rows from varieties on finite projective geometries
• A bound on the size of separating hash families
• Families of finite sets in which no set is covered by the union of \(r\) others
• New bounds for perfect hashing via information theory
• On codes with the identifiable parent property
• Separating systems
• On the upper bound of the size of the \(r\)-cover-free families
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Perfect hash families: Probabilistic methods and explicit constructions
• New upper bounds for parent-identifying codes and traceability codes
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Bounds for separating hash families
• On generalized separating hash families
• A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
• Graph removal lemmas
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Perfect Hashing and Probability
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• New Bounds for Frameproof Codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
• Perfect Hash Families: Constructions and Existence
• Separating Hash Families: A Johnson-type bound and New Constructions
• Parent-identifying codes

This page was built for publication: Some intriguing upper bounds for separating hash families