@inproceedings{7be696a4d6b14e6297c88a492b391396,
title = "On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms",
abstract = "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.",
keywords = "Berlekamp–Massey algorithm, Berlekamp–Massey–Sakata algorithm, Minimal polynomial, Reciprocal polynomial",
author = "Chenqi Mou and Xiaolin Fan",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 21st International Workshop on Computer Algebra in Scientific Computing, CASC 2019 ; Conference date: 26-08-2019 Through 30-08-2019",
year = "2019",
doi = "10.1007/978-3-030-26831-2\_24",
language = "英语",
isbn = "9783030268305",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "362--376",
editor = "Matthew England and Sadykov, \{Timur M.\} and Seiler, \{Werner M.\} and Wolfram Koepf and Vorozhtsov, \{Evgenii V.\}",
booktitle = "Computer Algebra in Scientific Computing - 21st International Workshop, CASC 2019, Proceedings",
address = "德国",
}