Decoding Reed-Muller codes over product sets

DOI10.4230/LIPICS.CCC.2016.11MaRDI QIDQ5368745zbMATH OpenFDO

Authors John Y. Kim, Swastik Kopparty

Publication date 10 October 2017

Full work available at URL https://arxiv.org/abs/1511.07488

zbMATH Keywords

Reed-Muller codescoding theoryerror-correcting codespolynomial codes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d<|S|$. Previously known algorithms can achieve this only if the set $S$ has some very special algebraic structure, or if the degree $d$ is significantly smaller than $|S|$. We also give a near-linear time randomized algorithm, which is based on tools from list-decoding, to decode these codes from nearly half their minimum distance, provided $d<(1-epsilon)|S|$ for constant $epsilon>0$. Our result gives an $m$-dimensional generalization of the well known decoding algorithms for Reed-Solomon codes, and can be viewed as giving an algorithmic version of the Schwartz-Zippel lemma.

Recommendations

• Decoding Reed-Muller codes over product sets
• scientific article; zbMATH DE number 1594297
• List Decoding of&lt;tex&gt;$q$&lt;/tex&gt;-ary Reed–Muller Codes
• Efficiently decoding Reed-Muller codes from random errors
• Decoding of Reed Solomon codes beyond the error-correction bound

Cited in

(8)

• DECODING OF MATRIX-PRODUCT CODES
• Generalized Hamming weights of affine Cartesian codes
• Decoding multivariate multiplicity codes on product sets
• Local decoding and testing of polynomials over grids
• Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
• Decoding variants of Reed-Muller codes over finite grids
• Decoding Reed-Muller codes over product sets
• Noisy interpolating sets for low-degree polynomials

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 Q5368745)