Pages that link to "Item:Q2469200"
From MaRDI portal
The following pages link to On generalized separating hash families (Q2469200):
Displaying 20 items.
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Constructions and bounds for separating hash families (Q724890) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Improved bounds on 2-frameproof codes with length 4 (Q1755996) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- New bounds on 2-frameproof codes of length 4 (Q1989034) (← links)
- Wide-sense 2-frameproof codes (Q2211333) (← links)
- A tight bound for frameproof codes viewed in terms of separating hash families (Q2249796) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
