Error Correcting Codes, finding polynomials of bounded degree agreeing on a dense fraction of a set of points

06/29/2020
โˆ™
by   Priyank Deshpande, et al.
โˆ™
0
โˆ™

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 ๐”ฝ^2 for some field ๐”ฝ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 06/09/2020

Hermitian-Lifted Codes

In this paper, we construct codes for local recovery of erasures with hi...
research
โˆ™ 07/13/2021

Tight bounds on the Fourier growth of bounded functions on the hypercube

We give tight bounds on the degree โ„“ homogenous parts f_โ„“ of a bounded f...
research
โˆ™ 05/22/2022

Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes

We study the following natural question on random sets of points in ๐”ฝ_2^...
research
โˆ™ 01/04/2023

Extremal polynomials on the n-grid

The n-grid E_n consists of n equally spaced points in [-1,1] including t...
research
โˆ™ 12/28/2019

Optimal Polynomial Prediction Measures and Extremal Polynomial Growth

We show that the problem of finding the measure supported on a compact s...
research
โˆ™ 04/27/2020

Learning Lines with Ordinal Constraints

We study the problem of finding a mapping f from a set of points into th...
research
โˆ™ 10/20/2022

Fast Evaluation of Real and Complex Polynomials

We propose an algorithm for quickly evaluating polynomials. It pre-condi...

Please sign up or login with your details

Forgot password? Click here to reset