Lower bounds on minimal distance of evaluation codes

Lower bounds on minimal distance of evaluation codes

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 st...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applicable algebra in engineering, communication and computing communication and computing, 2009-12, Vol.20 (5-6), p.351-360
1. Verfasser: Tohǎneanu, Ştefan O.
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Computer Hardware
Computer Science
Symbolic and Algebraic Manipulation
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-009-0102-8