scientific article; zbMATH DE number 7650135
From MaRDI portal
Publication:5875528
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.68MaRDI QIDQ5875528
Noga Ron-Zewi, Shashwat Silas, Swastik Kopparty, Nicolas Resch, Shubhangi Saraf
Publication date: 3 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tensor product of two good codes is not necessarily robustly testable
- Composition of semi-LTCs by two-wise tensor products
- Explicit subspace designs
- A linear time erasure-resilient code with nearly optimal recovery
- On the efficiency of local decoding procedures for error-correcting codes
- Polynomial Codes Over Certain Finite Fields
- The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
- Locally testable codes and PCPs of almost-linear length
- Combinatorial Construction of Locally Testable Codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Robust Local Testability of Tensor Products of LDPC Codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
- Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
- Robust Characterizations of Polynomials with Applications to Program Testing
- Local List Recovery of High-Rate Tensor Codes and Applications
- A combination of testability and decodability by tensor products
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Robust locally testable codes and products of codes
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Pseudorandom generators without the XOR lemma
