Asymptotically-good RLCCs with ( n)^2+o(1) queries
From MaRDI portal
Publication:6866489
Cites work
- 3-query locally decodable codes of subexponential length
- A hierarchy theorem for interactive proofs of proximity
- An adaptivity hierarchy theorem for property testing
- Asymptotically good Quantum and locally testable classical LDPC codes
- Composition of semi-LTCs by two-wise tensor products
- Designing programs that check their work
- Expander codes
- High-rate codes with sublinear-time decoding
- High-rate locally correctable and locally testable codes with sub-polynomial query complexity
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- scientific article; zbMATH DE number 7788438 (Why is no real title available?)
- LCC and LDC: tailor-made distance amplification and a refined separation
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Local correctability of expander codes
- Local proofs approaching the witness length (extended abstract)
- Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
- Locally testable codes with constant rate, distance, and locality
- Matching vector codes
- New affine-invariant codes from lifting
- Non-interactive proofs of proximity
- On relaxed locally decodable codes for Hamming and insertion-deletion errors
- On the efficiency of local decoding procedures for error-correcting codes
- On the power of relaxed local decoding algorithms
- Randomness conductors and constant-degree lossless expanders
- Rate amplification and query-efficient distance amplification for linear LCC and LDC
- Relaxed locally correctable codes
- Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
- Relaxed locally decodable and correctable codes: beyond tensoring
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
- Towards 3-query locally decodable codes of subexponential length
- Two-query PCP with subconstant error
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
This page was built for publication: Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866489)
