Lower bounds on minimal distance of evaluation codes

  • Authors:

  • Ştefan O. Tohǎneanu

  • Affiliations:

  • University of Cincinnati, Department of Mathematical Sciences, 45221-0025, Cincinnati, OH, USA

  • Venue:
  • Applicable Algebra in Engineering, Communication and Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In (J Pure Appl Algebra 196:91–99, 2005), the authors point 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 the syzygies.