The following pages link to (Q3549710):
Displayed 8 items.
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- Group homomorphisms as error correcting codes (Q490299) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- On the Bias of Reed--Muller Codes over Odd Prime Fields (Q5112827) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)