Minimal Gröbner bases and the predictable leading monomial property
From MaRDI portal
Publication:609485
Abstract: We focus on Gr"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr"{o}bner bases of modules in F[x]^q, no matter what positional term order is used. The PLM property is useful in a range of applications and can be seen as a strengthening of the wellknown predictable degree property (= row reducedness), a terminology introduced by Forney in the 70's. Because of the presence of zero divisors, minimal Gr"{o}bner bases over a finite ring of the type Z_p^r (where p is a prime integer and r is an integer >1) do not necessarily have the PLM property. In this paper we show how to derive, from an ordered minimal Gr"{o}bner basis, a so-called "minimal Gr"{o}bner p-basis" that does have a PLM property. We demonstrate that minimal Gr"obner p-bases lend themselves particularly well to derive minimal realization parametrizations over Z_p^r. Applications are in coding and sequences over Z_p^r.
Recommendations
- Strong Gröbner bases and cyclic codes over a finite-chain ring
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Strong Gröbner bases for polynomials over a principal ideal ring.
- Gröbner bases of characteristic ideals of LRS over UFD
- Gröbner bases over Galois rings with an application to decoding alternant codes
Cites work
- scientific article; zbMATH DE number 3732193 (Why is no real title available?)
- scientific article; zbMATH DE number 2000397 (Why is no real title available?)
- A Canonical Basis for the Ideals of a Polynomial Domain
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
- Convolutional codes I: Algebraic structure
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Gröbner bases over Galois rings with an application to decoding alternant codes
- Gröbner bases with coefficients in rings
- Lifting standard bases in filtered structures
- Linear recurrence sequences over commutative rings
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- Multidimensional constant linear systems
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- New developments in the theory of Gröbner bases and applications to formal verification
- On Minimality of Convolutional Ring Encoders
- On the key equation
- Shift Register Synthesis (Modulo m)
- Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- The predictable degree property and row reducedness for systems over a finite ring
Cited in
(5)- State representations of convolutional codes over a finite ring
- Finite multidimensional behaviors
- A module minimization approach to Gabidulin decoding via interpolation
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
- Minimal basis of the syzygy module of leading terms
This page was built for publication: Minimal Gröbner bases and the predictable leading monomial property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609485)
