Solving a multivariable congruence by change of term order

DOI10.1006/JSCO.1997.0153MaRDI QIDQ1376581zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Berlekamp-Massey algorithmGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Recommendations

• A Gröbner basis technique for Padé approximation
• scientific article; zbMATH DE number 1714661
• scientific article; zbMATH DE number 1273642

Cited in

(9)

• A Gröbner basis technique for Padé approximation
• Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation.
• Computing syzygies in finite dimension using fast linear algebra
• Gröbner basis approach to list decoding of algebraic geometry codes
• Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y]\)
• On the ideal associated to a linear code
• Algebraic structure of quasicyclic codes
• Algorithms for linearly recurrent sequences of truncated polynomials
• Gröbner bases and combinatorics for binary codes

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)