Bounds for separating hash families
DOI10.1016/J.JCTA.2010.11.006zbMATH Open1231.68173OpenAlexW2018821316MaRDI QIDQ2431271FDOQ2431271
Authors: Marjan Bazrafshan, Tran van Trung 
Publication date: 11 April 2011
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.2010.11.006
Recommendations
- A bound on the size of separating hash families
- Constructions and bounds for separating hash families
- Some intriguing upper bounds for separating hash families
- Improved bounds for separating hash families
- A tight bound on the size of certain separating hash families
- On generalized separating hash families
- Separating hash families: a Johnson-type bound and new constructions
- Improved bounds on the size of separating hash families of short length
- Covering strong separating hash families
- A new lower bound on perfect hash families
Data encryption (aspects in computer science) (68P25) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Frameproof Codes
- Collusion-secure fingerprinting for digital data
- Title not available (Why is that?)
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- Combinatorial properties of frameproof and traceability codes
- On codes with the identifiable parent property
- Perfect hash families: Probabilistic methods and explicit constructions
- On generalized separating hash families
- Explicit constructions for perfect hash families
- New constructions for IPP codes
- Constructions of 2-cover-free families and related separating hash families
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect Hash Families: Constructions and Existence
- A bound on the size of separating hash families
Cited In (13)
- New bounds on 2-frameproof codes of length 4
- Title not available (Why is that?)
- Distributing hash families with few rows
- Strongly separable codes
- Separating Hash Families: A Johnson-type bound and New Constructions
- Improved bounds on 2-frameproof codes with length 4
- Constructions and bounds for separating hash families
- Improved bounds for separating hash families
- On tight bounds for binary frameproof codes
- Some intriguing upper bounds for separating hash families
- A tight bound for frameproof codes viewed in terms of separating hash families
- Strengthening hash families and compressive sensing
- Linear Time Constructions of Some $$d$$-Restriction Problems
This page was built for publication: Bounds for separating hash families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431271)
