APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS

DOI10.1142/S0219498813500345zbMath1281.13017OpenAlexW2073700140MaRDI QIDQ2853970

Parisa Alvandi, Amir Hashemi

Publication date: 17 October 2013

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498813500345

zbMATH Keywords

Gröbner basesBuchberger's algorithmBuchberger's criteriafinite-chain rings

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Efficient Gröbner bases computation over principal ideal rings, GBGR.mpl, Skew Reed-Muller codes

Uses Software

• Maple

Cites Work

• Unnamed Item
• On an installation of Buchberger's algorithm
• Cyclic codes over the integers modulo \(p^m\).
• Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
• Modular and \(p\)-adic cyclic codes
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Strong Gröbner bases for polynomials over a principal ideal ring
• On the key equation
• Gröbner bases over Galois rings with an application to decoding alternant codes