Shift Register Synthesis (Modulo m )
James A. Reeds, Neil J.A. Sloane · SIAM Journal on Computing · 1985
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.