Efficient Local Correction and List Decoding of Linear Functions over the Boolean Cube

The paper presents efficient local correction and local list correction algorithms for linear polynomials over the Boolean cube {0,1}^n, with applications to constructing the first non-trivial locally correctable codes over the reals.