List decoding quotient Reed-Muller codes

DOI10.4230/LIPICS.CCC.2025.1MaRDI QIDQ7296746zbMATH OpenFDO

Authors Omri Gotlib, Tali Kaufman, Shachar Lovett

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2025.1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• Efficiently List-Decodable Punctured Reed-Muller Codes
• Every locally characterized affine-invariant property is testable
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fooling polynomials using invariant theory
• Higher-order Fourier analysis and applications
• scientific article; zbMATH DE number 5485538 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 5485568 (Why is no real title available?)
• On hitting-set generators for polynomials that vanish rarely
• Properties of high rank subvarieties of affine spaces
• Pseudorandom generators for low degree polynomials
• Random Low Degree Polynomials are Hard to Approximate
• Testers and their applications
• The density of integer points on homogeneous varieties

This page was built for publication: List decoding quotient Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296746)