Lower bounds on minimal distance of evaluation codes (Q843946)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5659682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on minimal distance of evaluation codes |
scientific article; zbMATH DE number 5659682 |
Statements
Lower bounds on minimal distance of evaluation codes (English)
0 references
18 January 2010
0 references
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.
0 references
Gorenstein ring
0 references
complete intersection
0 references
syzygies
0 references
evaluation code
0 references
0 references
0.8149245977401733
0 references
0.8073195219039917
0 references
0.8072444796562195
0 references
0.7797409296035767
0 references
0.7731650471687317
0 references
