Pages that link to "Item:Q1122979"
From MaRDI portal
The following pages link to New bounds for perfect hashing via information theory (Q1122979):
Displaying 30 items.
- Symmetric graphs with respect to graph entropy (Q510346) (← links)
- Approximation of functions of few variables in high dimensions (Q623354) (← links)
- Maximum IPP codes of length 3 (Q659811) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- On codes with the identifiable parent property (Q1268617) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- A generalization of the Bollobás set pairs inequality (Q2040005) (← links)
- Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
- New bounds for perfect \(k\)-hashing (Q2217492) (← links)
- Complexity of approximation of functions of few variables in high dimensions (Q2431335) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
- Perfect Hashing and Probability (Q4314156) (← links)
- Beating Fredman-Komlós for Perfect k-Hashing. (Q5091253) (← links)
- (Q5111291) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Separation and Witnesses (Q5322994) (← links)
- Cross‐intersecting couples of graphs (Q5434247) (← links)
- Recursive bounds for perfect hashing (Q5939232) (← links)
- A better bound for locally thin set families (Q5947361) (← links)
- Generalizing Körner's graph entropy to graphons (Q6080368) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
