Pages that link to "Item:Q1417959"
From MaRDI portal
The following pages link to Generalized hashing and parent-identifying codes. (Q1417959):
Displaying 13 items.
- Yet another variation on minimal linear codes (Q259266) (← links)
- Strongly separable codes (Q285247) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- Generalization of IPP codes and IPP set systems (Q2190902) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- On non-binary traceability set systems (Q2200518) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Separation and Witnesses (Q5322994) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
