Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
From MaRDI portal
Recommendations
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- List-Decodability With Large Radius for Reed-Solomon Codes
- Improved list-decodability of random linear binary codes
- Improved List-Decodability of Random Linear Binary Codes
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Improved lower bounds on the sizes of error-correcting codes for list decoding
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
Cites work
- A Fourier-Analytic Approach to Reed–Muller Decoding
- A linear time erasure-resilient code with nearly optimal recovery
- Automata, Languages and Programming
- Codes for the \(m\)-metric
- Decoding multivariate multiplicity codes on product sets
- Decoding of Reed Solomon codes beyond the error-correction bound
- Decoding Reed-Muller codes over product sets
- Error-correcting codes for list decoding
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Explicit subspace designs
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- High-rate codes with sublinear-time decoding
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- scientific article; zbMATH DE number 5485538 (Why is no real title available?)
- scientific article; zbMATH DE number 1306883 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Improved low-degree testing and its applications
- Learning Decision Trees Using the Fourier Spectrum
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- List-Decoding Algorithms for Lifted Codes
- List-decoding multiplicity codes
- Local list recovery of high-rate tensor codes and applications
- Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
- On List Recovery of High-Rate Tensor Codes
- On the efficiency of local decoding procedures for error-correcting codes
- Pseudorandom generators without the XOR lemma
- Reed-solomon codes for correcting phased error bursts
- Robust Characterizations of Polynomials with Applications to Program Testing
- Subspace evasive sets
- The List Decoding Radius for Reed–Muller Codes Over Small Fields
Cited in
(10)- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Reduced lists of error patterns for maximum likelihood soft decoding
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- Better Binary List-Decodable Codes Via Multilevel Concatenation
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
- Folded codes from function field towers and improved optimal rate list decoding
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Variety evasive subspace families
- Duals of multiplicity codes
- List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
This page was built for publication: Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110528)
