Ariel Gabizon – Bounds on list decoding of Reed-Solomon codes using subspace polynomials

Event Details

  • Date:

We present a result of Ben-Sasson, Kopparty and Radhakrishnan who give an upper bound
on the radius in which Reed-Solomon codes can be list decoded.
Their proof shows that the ball around a certain subspace polynomial contains many codewords.

We will also discuss an open question on subspace polynomials whose solution could improve the bound.