Lower bounds on minimal distance of evaluation codes (Q843946)

From the abstract: \textit{L. Gold, J. Little} and \textit{H. Schenck} [J. Pure Appl. Algebra 196, No. 1, 91--99 (2005; Zbl 1070.14027)] pointed out that the methods they use to find a lower bound for the minimal distance of complete intersection evaluation codes should apply to the case of (arithmetically) Gorenstein evaluation codes. In this note we show this is the case and we study other lower bounds on the minimal distance coming from syzygies.