Pages that link to "Item:Q2706184"
From MaRDI portal
The following pages link to Learning Polynomials with Queries: The Highly Noisy Case (Q2706184):
Displayed 5 items.
- List decoding of the first-order binary Reed-Muller codes (Q927477) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ (Q3535361) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)