Minimal Gröbner bases and the predictable leading monomial property
From MaRDI portal
Publication:609485
DOI10.1016/J.LAA.2010.08.030zbMATH Open1200.13050arXiv0906.4602OpenAlexW2963850033MaRDI QIDQ609485FDOQ609485
Authors: Sumit K. Garg 
Publication date: 1 December 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0906.4602
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
parametrizationfinite ringpolynomial vector moduluepositional term ordershortest linear recurrence relationminimal Gröbner basis
Cites Work
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Convolutional codes I: Algebraic structure
- Multidimensional constant linear systems
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Lifting standard bases in filtered structures
- Gröbner bases over Galois rings with an application to decoding alternant codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Title not available (Why is that?)
- Gröbner bases with coefficients in rings
- Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
- On the key equation
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- On Minimality of Convolutional Ring Encoders
- The predictable degree property and row reducedness for systems over a finite ring
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Shift Register Synthesis (Modulo m)
- Linear recurrence sequences over commutative rings
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- New developments in the theory of Gröbner bases and applications to formal verification
- Title not available (Why is that?)
- Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
- A Canonical Basis for the Ideals of a Polynomial Domain
Cited In (5)
Uses Software
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)
