A high dimensional Goldreich-Levin theorem
From MaRDI portal
Publication:6499315
DOI10.1145/3564246.3585224MaRDI QIDQ6499315
Parker Newton, Silas Richelson, Chase Wilson
Publication date: 8 May 2024
Goldreich-Levin theoremapproximate list decodable codeseffective property testinghigh dimensional linearity testingprediction implies inversion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-testing/correcting with applications to numerical problems
- Decoding of Reed Solomon codes beyond the error-correction bound
- On the Bogolyubov-Ruzsa lemma
- Low-degree test with polynomially small error
- Linearity testing in characteristic two
- On the efficiency of local decoding procedures for error-correcting codes
- Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
- Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
- Local Decoding and Testing for Homomorphisms
- Coin flipping by telephone a protocol for solving impossible problems
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- A Pseudorandom Generator from any One-way Function
- Learning Decision Trees Using the Fourier Spectrum
- Explicit, almost optimal, epsilon-balanced codes
- Quadratic Goldreich--Levin Theorems
This page was built for publication: A high dimensional Goldreich-Levin theorem
