A bound on the size of separating hash families
From MaRDI portal
Publication:958729
DOI10.1016/j.jcta.2008.01.009zbMath1158.68003OpenAlexW2067182672MaRDI QIDQ958729
Simon R. Blackburn, Gregory M. Zaverucha, Douglas R. Stinson, Tuvi Etzion
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2008.01.009
Related Items (12)
Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Improved bounds for separating hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Strengthening hash families and compressive sensing ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Bounds for separating hash families ⋮ Some intriguing upper bounds for separating hash families ⋮ New bounds on 2-frameproof codes of length 4 ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Constructions and bounds for separating hash families ⋮ Unnamed Item
Cites Work
- Optimal linear perfect hash families
- Generalized hashing and parent-identifying codes.
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Perfect hash families: Probabilistic methods and explicit constructions
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- On generalized separating hash families
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
This page was built for publication: A bound on the size of separating hash families
