𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Decoding of Cyclic Codes Using Gröbner Bases

✍ Scribed by Philippe Loustaunau; Eric V. York

Publisher
Springer
Year
1997
Tongue
English
Weight
274 KB
Volume
8
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gröbner Bases over Galois Rings with an
Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes
✍ 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

On the Complexity of Gröbner Bases Conve
On the Complexity of Gröbner Bases Conversion
✍ Michael Kalkbrener 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paper, the complexity of the conversion problem for Gröbner bases is investigated. It is shown that for adjacent Gröbner bases F and G, the maximal degree of the polynomials in G, denoted by deg(G), is bounded by a quadratic polynomial in deg(F ). For non-adjacent Gröbner bases, however, the

On the Stability of Gröbner Bases Under
On the Stability of Gröbner Bases Under Specializations
✍ MICHAEL KALKBRENER 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Let R be a Noetherian commutative ring with identity, K a field and π a ring homomorphism from R to K. We investigate for which ideals in R[x 1 , . . . , xn] and admissible orders the formation of leading monomial ideals commutes with the homomorphism π.