Local Decoding and Testing for Homomorphisms
From MaRDI portal
Publication:3595384
DOI10.1007/11830924_35zbMATH Open1155.94408OpenAlexW1593724039MaRDI QIDQ3595384FDOQ3595384
Authors: Elena Grigorescu, Swastik Kopparty, Madhu Sudan 
Publication date: 28 August 2007
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11830924_35
Recommendations
- Locally testable vs. locally decodable codes
- Local decoding and testing of polynomials over grids
- Local decoding and testing of polynomials over grids
- Strong locally testable codes with relaxed local decoders
- Strong locally testable codes with relaxed local decoders
- Local decodability of the Burrows-Wheeler transform
- Locally testable codes and Cayley graphs
- Combinatorial construction of locally testable codes
- Short locally testable codes and proofs
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
Cited In (7)
- Derandomizing Homomorphism Testing in General Groups
- Derandomizing homomorphism testing in general groups
- Coding for locality in reconstructing permutations
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Quantum search-to-decision reduction for the LWE problem
- Group homomorphisms as error correcting codes
- A high dimensional Goldreich-Levin theorem
This page was built for publication: Local Decoding and Testing for Homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595384)
