Pages that link to "Item:Q4977975"
From MaRDI portal
The following pages link to Explicit, almost optimal, epsilon-balanced codes (Q4977975):
Displaying 15 items.
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Essential components in vector spaces over finite fields (Q2043673) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- (Q4048927) (← links)
- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates (Q5090395) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)
- Non-malleable codes with optimal rate for poly-size circuits (Q6637518) (← links)
- Traceable secret sharing: strong security and efficient constructions (Q6652970) (← links)
- Pseudorandom error-correcting codes (Q6652990) (← links)
