On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms
- 735 Downloads
The Berlekamp–Massey and Berlekamp–Massey–Sakata algorithms compute a minimal polynomial or polynomial set of a linearly recurring sequence or multi-dimensional array. In this paper some underlying properties of and connections between these two algorithms are clarified theoretically: a unified flow chart for both algorithms is proposed to reveal their connections; the polynomials these two algorithms maintain at each iteration are proved to be reciprocal when both algorithms are applied to the same sequence; and the uniqueness of the choices of polynomials from two critical polynomial sets in the Berlekamp–Massey–Sakata algorithm is investigated.
KeywordsBerlekamp–Massey algorithm Berlekamp–Massey–Sakata algorithm Minimal polynomial Reciprocal polynomial
The authors would like to thank the anonymous reviewers for their helpful suggestion which contribute to considerable improvement of this paper.
- 3.Berthomieu, J., Faugère, J.C.: In-depth comparison of the Berlekamp-Massey-Sakata and the scalar-FGLM algorithms: The adaptive variants. arXiv:1806.00978 (2018, preprint)
- 4.Berthomieu, J., Faugère, J.C.: A polynomial-division-based algorithm for computing linear recurrence relations. In: Proceedings of ISSAC 2018, pp. 79–86. ACM Press (2018)Google Scholar
- 7.Faugère, J.C., Mou, C.: Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. In: Proceedings of ISSAC 2011, pp. 115–122. ACM, ACM Press (2011)Google Scholar