Answers are grounded in this paper and cite their sources.
The Berlekamp–Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.
No takes yet. Share an insight, caveat, or question.
Reeds et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: