Decoding Reed-Muller codes over product sets

DOI10.4086/TOC.2017.V013A021MaRDI QIDQ4602396zbMATH OpenOpenAlexFDO

Authors John Y. Kim, Swastik Kopparty

Publication date 10 January 2018

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2017.v013a021

zbMATH Keywords

algebraic algorithmserror-correcting codesReed-Muller codesSchwartz-Zippel lemma

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Symbolic computation and algebraic computation (68W30) Decoding (94B35)

Recommendations

• Decoding Reed-Muller codes over product sets
• Decoding Reed-Muller codes beyond half the minimum distance
• List-decoding multiplicity codes
• Efficiently decoding Reed-Muller codes from random errors
• Decoding of Reed Solomon codes beyond the error-correction bound

Cited in

(14)

• Algorithms for modular counting of roots of multivariate polynomials
• Decoding Reed-Muller codes beyond half the minimum distance
• List-decoding multiplicity codes
• Noisy interpolating sets for low-degree polynomials
• Some remarks on multiplicity codes
• Algorithms for Modular Counting of Roots of Multivariate Polynomials
• Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
• DECODING OF MATRIX-PRODUCT CODES
• Decoding Reed-Muller codes over product sets
• Decoding variants of Reed-Muller codes over finite grids
• Decoding multivariate multiplicity codes on product sets
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• Algorithmizing the multiplicity Schwartz-Zippel lemma
• Polynomials, divided differences, and codes

This page was built for publication: Decoding Reed-Muller codes over product sets

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