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 Edit this on Wikidata


Publication date: 10 October 2017

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 Sm, 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<(1epsilon)|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.


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




Recommendations





Cited In (8)





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)