Minimal Gröbner bases and the predictable leading monomial property
From MaRDI portal
Publication:609485
DOI10.1016/j.laa.2010.08.030zbMath1200.13050arXiv0906.4602MaRDI QIDQ609485
Publication date: 1 December 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.4602
parametrization; finite ring; minimal Gröbner basis; polynomial vector modulue; positional term order; shortest linear recurrence relation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings, Finite multidimensional behaviors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
- Multidimensional constant linear systems
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- The predictable degree property and row reducedness for systems over a finite ring
- New developments in the theory of Gröbner bases and applications to formal verification
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Gröbner bases with coefficients in rings
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Shift Register Synthesis (Modulo m)
- Linear recurrence sequences over commutative rings
- Lifting standard bases in filtered structures
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- 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
- On the key equation
- On Minimality of Convolutional Ring Encoders
- Convolutional codes I: Algebraic structure
- A Canonical Basis for the Ideals of a Polynomial Domain
- Gröbner bases over Galois rings with an application to decoding alternant codes
