Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
From MaRDI portal
Publication:6110528
DOI10.1137/20m1370215OpenAlexW4380741288MaRDI QIDQ6110528
Noga Ron-Zewi, Swastik Kopparty, Mary Wootters, Shubhangi Saraf
Publication date: 6 July 2023
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1370215
Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60) Decoding (94B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decoding of Reed Solomon codes beyond the error-correction bound
- Codes for the \(m\)-metric
- Explicit subspace designs
- Improved low-degree testing and its applications
- Some remarks on multiplicity codes
- List-Decoding Algorithms for Lifted Codes
- A linear time erasure-resilient code with nearly optimal recovery
- On the efficiency of local decoding procedures for error-correcting codes
- Error-correcting codes for list decoding
- Reed-solomon codes for correcting phased error bursts
- 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
- Robust Characterizations of Polynomials with Applications to Program Testing
- Efficient List-Decoding With Constant Alphabet and List Sizes
- Local List Recovery of High-Rate Tensor Codes and Applications
- On List Recovery of High-Rate Tensor Codes
- A Fourier-Analytic Approach to Reed–Muller Decoding
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- The List Decoding Radius for Reed–Muller Codes Over Small Fields
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Subspace evasive sets
- Automata, Languages and Programming
- High-rate codes with sublinear-time decoding
- Pseudorandom generators without the XOR lemma
- Decoding multivariate multiplicity codes on product sets
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
This page was built for publication: Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
