We give a survey of results and applications relating to the theory of Gröbner bases of ideals and modules where the coefficient ring is a finite commutative ring. For applications, we specialize to the case of a finite chain ring.We discuss and compare the main algorithms that may be implemented to compute Gröbner and (in the case of a chain ring) Szekeres-like bases. We give an account of a number of decoding algorithms for alternant codes over commutative finite chain rings.
Groebner bases over commutative rings and Applications to coding theory
MORA, FERDINANDO;
2009-01-01
Abstract
We give a survey of results and applications relating to the theory of Gröbner bases of ideals and modules where the coefficient ring is a finite commutative ring. For applications, we specialize to the case of a finite chain ring.We discuss and compare the main algorithms that may be implemented to compute Gröbner and (in the case of a chain ring) Szekeres-like bases. We give an account of a number of decoding algorithms for alternant codes over commutative finite chain rings.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
