Applicable Algebra in Engineering, Communication and Computing

, 20:351

Lower bounds on minimal distance of evaluation codes

Article

DOI: 10.1007/s00200-009-0102-8

Cite this article as:
Tohǎneanu, Ş.O. AAECC (2009) 20: 351. doi:10.1007/s00200-009-0102-8

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.

Keywords

Gorenstein ringComplete intersectionSyzygiesEvaluation codes

Mathematics Subject Classification (2000)

Primary: 16E6513D02Secondary: 94B27

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  1. 1.Department of Mathematical SciencesUniversity of CincinnatiCincinnatiUSA