Lower bounds on minimal distance of evaluation codes
- First Online:
- Cite this article as:
- Tohǎneanu, Ş.O. AAECC (2009) 20: 351. doi:10.1007/s00200-009-0102-8
- 72 Downloads
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.