Pages that link to "Item:Q1269893"
From MaRDI portal
The following pages link to Optimal linear perfect hash families (Q1269893):
Displaying 22 items.
- Improved bounds for separating hash families (Q369437) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← 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)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant (Q2275918) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- A sequence approach to linear perfect hash families (Q2384060) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Geometric constructions of optimal linear perfect hash families (Q2469464) (← links)
- Distributing the encryption and decryption of a block cipher (Q2572965) (← links)
- Anonymity in shared symmetric key primitives (Q2638423) (← links)
- Structures of a type of perfect hash function family (Q2860345) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Optimal linear perfect hash families with small parameters (Q3156924) (← links)
- A recursive construction for perfect hash families (Q3558748) (← links)
- New constructions for perfect hash families and related structures using combinatorial designs and codes (Q4487082) (← links)
- Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
- Broadcast authentication for group communication (Q5958610) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
