An example of an infinitely generated graded ring motivated by coding theory (Q1434807)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An example of an infinitely generated graded ring motivated by coding theory |
scientific article; zbMATH DE number 2078917
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An example of an infinitely generated graded ring motivated by coding theory |
scientific article; zbMATH DE number 2078917 |
Statements
An example of an infinitely generated graded ring motivated by coding theory (English)
0 references
12 July 2004
0 references
Let \(R^{(g)}\) be the graded ring generated by the \(r\)-th higher weight enumerators of all codes of any length \(1 \leq r \leq g\). It is proved that \(R^{(g)}\) is not finitely generated. Codes over fields are considered.
0 references
graded ring
0 references
higher weight enumerator
0 references
codes
0 references
0.8566998
0 references
0.8482799
0 references
0.84172165
0 references
0.8412805
0 references
0 references
0 references
