The BMS Algorithm

DOI10.1007/978-3-540-93806-4_9zbMath1177.94212OpenAlexW82081850MaRDI QIDQ3652816

Shojiro Sakata

Publication date: 16 December 2009

Published in: Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93806-4_9

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Arithmetic codes (94B40)

Related Items

Polynomial-division-based algorithms for computing linear recurrence relations, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, On the evaluation codes given by simple \(\delta \)-sequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm, Guessing Gröbner bases of structured ideals of relations of sequences, Sparse interpolation in terms of multivariate Chebyshev polynomials