1985/08/01 by James A. Reeds, N. J. A. Sloane · 2 citations
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #graph theory and CDMA systems #Cellular Automata and Applications #Modulo #Sequence (biology) #Shift register #Primitive root modulo n #Prime (order theory) #Integer (computer science) #Combinatorics #Mathematics #Discrete mathematics #Register (sociolinguistics) #Prime number #Field (mathematics) #Arithmetic #Algorithm #Computer science #Pure mathematics
paper · doi:10.1137/0214038
openalex publication_date 1985/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
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.