Solving a multivariable congruence by change of term order
DOI10.1006/JSCO.1997.0153zbMATH Open0895.68074OpenAlexW2060182507MaRDI QIDQ1376581FDOQ1376581
Authors: Patrick Fitzpatrick
Publication date: 27 September 1998
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9f41c705d6c666bf3a5d635dbb09bd622c86b498
Recommendations
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]Berlekamp-Massey algorithm
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (9)
- Gröbner basis approach to list decoding of algebraic geometry codes
- Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation.
- Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\)
- On the ideal associated to a linear code
- A Gröbner basis technique for Padé approximation
- Gröbner bases and combinatorics for binary codes
- Computing syzygies in finite dimension using fast linear algebra
- Algebraic structure of quasicyclic codes
- Algorithms for linearly recurrent sequences of truncated polynomials
This page was built for publication: Solving a multivariable congruence by change of term order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376581)