Local List Recovery of High-Rate Tensor Codes and Applications
From MaRDI portal
Publication:5117374
DOI10.1137/17M116149XzbMath1468.94461arXiv1706.03383OpenAlexW2981502670MaRDI QIDQ5117374
Noga Ron-Zewi, Mary Wootters, Brett Hemenway
Publication date: 25 August 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03383
Related Items
Erasures versus errors in local decoding and property testing ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tensor product of two good codes is not necessarily robustly testable
- On the rectangle method in proofs of robustness of tensor products
- Composition of semi-LTCs by two-wise tensor products
- Derandomizing Arthur-Merlin games using hitting sets
- Cyclotomic function fields, Artin-Frobenius automorphisms, and list error correction with optimal rate
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
- Linear-time list recovery of high-rate expander codes
- Local correctability of expander codes
- Explicit subspace designs
- Fast systematic encoding of multiplicity codes
- Extractors from Reed-Muller codes
- Some remarks on multiplicity codes
- List-Decoding Algorithms for Lifted Codes
- List Decoding Tensor Products and Interleaved Codes
- A linear time erasure-resilient code with nearly optimal recovery
- The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Parallel Hashing via List Recoverability
- Algebraic Function Fields and Codes
- Extractor Codes
- Combinatorial Construction of Locally Testable Codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- Robust Local Testability of Tensor Products of LDPC Codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Learning Decision Trees Using the Fourier Spectrum
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
- Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
- A combination of testability and decodability by tensor products
- ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
- Folded codes from function field towers and improved optimal rate list decoding
- Subspace evasive sets
- Extractors and pseudorandom generators
- 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
This page was built for publication: Local List Recovery of High-Rate Tensor Codes and Applications
