List decoding of evaluation codes

Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also known as Toric codes, that are defined for any given convex polytope P. Special cases, such as Reed-Solomon and Reed-Muller codes, have been studied extensively. We present a generalization of the Guruswami-Sudan algorithm that takes into account the geometry and the combinatorics of P and compute bounds for the decoding radius.