Abstract

We give a survey of results and applications relating to the theory of Grobner 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 Grobner 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call