Pages that link to "Item:Q3816014"
From MaRDI portal
The following pages link to Zero error capacity under list decoding (Q3816014):
Displaying 8 items.
- The hat guessing number of graphs (Q777481) (← links)
- List decoding (Q1199579) (← links)
- Randomness in secret sharing and visual cryptography schemes (Q1826638) (← links)
- Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
- New bounds for perfect \(k\)-hashing (Q2217492) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Search with noisy and delayed response (Q3439235) (← links)
- Beating Fredman-Komlós for Perfect k-Hashing. (Q5091253) (← links)
