Pages that link to "Item:Q1586126"

The following pages link to Perfect hash families: Probabilistic methods and explicit constructions (Q1586126):

Displaying 20 items.

• Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
• Improved bounds for separating hash families (Q369437) (← links)
• Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
• Generalised cumulative arrays in secret sharing (Q851749) (← links)
• Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
• A bound on the size of separating hash families (Q958729) (← links)
• Explicit constructions for perfect hash families (Q1008968) (← links)
• Linear hash families and forbidden configurations (Q1009168) (← links)
• Some intriguing upper bounds for separating hash families (Q1729948) (← links)
• Improving two recursive constructions for covering arrays (Q2322060) (← links)
• A sequence approach to linear perfect hash families (Q2384060) (← links)
• Bounds for separating hash families (Q2431271) (← links)
• On generalized separating hash families (Q2469200) (← links)
• Geometric constructions of optimal linear perfect hash families (Q2469464) (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
• On the state of strength-three covering arrays (Q3150159) (← links)
• Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
• Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
• Bounds for \(c\)-ideal hashing (Q6546593) (← links)