In this talk, second in the series, we will show how to extend the ``Reed-Solomon list-decoding'' algorithms to other algebraic/number-theoretic error-correcting codes; and show how to use it modularly to correct codes based on multivariate polynomials. Time permitting, we will also survey other list-decoding algorithms in the literature.