𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong Gröbner bases and cyclic codes over a finite-chain ring.

✍ Scribed by Graham H. Norton; Ana Sǎlǎgean


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
702 KB
Volume
6
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Analogs of Gröbner Bases in Polynomial R
✍ LYN J. MILLER 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

In this paper we will define analogs of Gröbner bases for R-subalgebras and their ideals in a polynomial ring R[x 1 , . . . , xn] where R is a noetherian integral domain with multiplicative identity and in which we can determine ideal membership and compute syzygies. The main goal is to present and

Gröbner Bases over Galois Rings with an
✍ Eimear Byrne; Patrick Fitzpatrick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 346 KB

We develop a theory of Gröbner bases over Galois rings, following the usual formulation for Gröbner bases over finite fields. Our treatment includes a division algorithm, a characterization of Gröbner bases, and an extension of Buchberger's algorithm. One application is towards the problem of decodi

Gröbner Bases and Normal Forms in a Subr
✍ J. Snellman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 511 KB

If K is a field, let the ring R consist of finite sums of homogeneous elements in Then, R contains M, the free semi-group on the countable set of variables {x 1 , x 2 , x 3 , . . .}. In this paper, we generalize the notion of admissible order from finitely generated sub-monoids of M to M itself; as