Decoding Reed-Muller codes over product sets
From MaRDI portal
Publication:5368745
DOI10.4230/LIPICS.CCC.2016.11zbMATH Open1380.94148arXiv1511.07488MaRDI QIDQ5368745FDOQ5368745
Authors: John Y. Kim, Swastik Kopparty
Publication date: 10 October 2017
Abstract: We give a polynomial time algorithm to decode multivariate polynomial codes of degree up to half their minimum distance, when the evaluation points are an arbitrary product set , for every . Previously known algorithms can achieve this only if the set has some very special algebraic structure, or if the degree is significantly smaller than . 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 for constant . Our result gives an -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.
Full work available at URL: https://arxiv.org/abs/1511.07488
Recommendations
Cited In (8)
- Local decoding and testing of polynomials over grids
- DECODING OF MATRIX-PRODUCT CODES
- Decoding multivariate multiplicity codes on product sets
- Noisy interpolating sets for low-degree polynomials
- Decoding Reed-Muller codes over product sets
- Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
- Decoding variants of Reed-Muller codes over finite grids
- Generalized Hamming weights of affine Cartesian 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 Q5368745)