An example of an infinitely generated graded ring motivated by coding theory (Q1434807): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3792/pjaa.79.134 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092362888 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Higher weights and graded rings for binary self-dual codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Higher weights for ternary and quaternary self-dual codes* / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5664012 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The invariants of the Clifford groups / rank | |||
Normal rank | |||
Latest revision as of 18:30, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An example of an infinitely generated graded ring motivated by coding theory |
scientific article |
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
