Optimal List-Decoding of Polynomial Ideal Codes with Efficient Algorithms

Randomly punctured polynomial ideal codes over an exponentially large alphabet exactly achieve the Singleton bound for list-decoding, while those over a polynomially large alphabet approximately achieve it. These codes can also be efficiently list-decoded up to the (approximate) Singleton bound.