An example of an infinitely generated graded ring motivated by coding theory
Oura, Manabu
Proc. Japan Acad. Ser. A Math. Sci., Tome 79 (2003) no. 3, p. 134-135 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Let $\widetilde{\mathfrak{H}}^{(g)}$ be the graded ring generated by the $r$-th higher weight enumerators of all codes of any length, $1 \leq r \leq g$. In this note we will prove that $\widetilde{\mathfrak{H}}^{(g)}$ is not finitely generated.
Publié le : 2003-10-14
Classification:  Code,  weight enumerator,  higher weight enumerator,  graded ring,  11T71,  94B05 
@article{1116443715,
     author = {Oura, Manabu},
     title = {An example of an infinitely generated graded ring motivated by coding theory},
     journal = {Proc. Japan Acad. Ser. A Math. Sci.},
     volume = {79},
     number = {3},
     year = {2003},
     pages = { 134-135},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1116443715}
}

Oura, Manabu. An example of an infinitely generated graded ring motivated by coding theory. Proc. Japan Acad. Ser. A Math. Sci., Tome 79 (2003) no. 3, pp.  134-135. http://gdmltest.u-ga.fr/item/1116443715/