Pages that link to "Item:Q369437"
From MaRDI portal
The following pages link to Improved bounds for separating hash families (Q369437):
Displaying 15 items.
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- Explicit constructions of separating hash families from algebraic curves over finite fields (Q851784) (← links)
- On tight bounds for binary frameproof codes (Q887414) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- New bounds for perfect hashing via information theory (Q1122979) (← links)
- Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma (Q1645018) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- New constructions for perfect hash families and related structures using combinatorial designs and codes (Q4487082) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
