Error Correcting Codes, finding polynomials of bounded degree agreeing on a dense fraction of a set of points
Symbolic Computation
2020-07-02 v1 Data Structures and Algorithms
Abstract
Here we present some revised arguments to a randomized algorithm proposed by Sudan to find the polynomials of bounded degree agreeing on a dense fraction of a set of points in for some field .
Keywords
Cite
@article{arxiv.2007.00445,
title = {Error Correcting Codes, finding polynomials of bounded degree agreeing on a dense fraction of a set of points},
author = {Priyank Deshpande},
journal= {arXiv preprint arXiv:2007.00445},
year = {2020}
}