Geodesic
The Berlekamp–Massey algorithm over finite rings, modules and bimodules
Diskretnaya Matematika, Tome 10 (1998) no. 4, pp. 3-34 
V. L. Kurakin. The Berlekamp–Massey algorithm over finite rings, modules and bimodules. Diskretnaya Matematika, Tome 10 (1998) no. 4, pp. 3-34. http://geodesic.mathdoc.fr/item/DM_1998_10_4_a0/
@article{DM_1998_10_4_a0,
     author = {V. L. Kurakin},
     title = {The {Berlekamp{\textendash}Massey} algorithm over finite rings, modules and bimodules},
     journal = {Diskretnaya Matematika},
     pages = {3--34},
     year = {1998},
     volume = {10},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_4_a0/}
}
TY  - JOUR
AU  - V. L. Kurakin
TI  - The Berlekamp–Massey algorithm over finite rings, modules and bimodules
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 3
EP  - 34
VL  - 10
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_4_a0/
LA  - ru
ID  - DM_1998_10_4_a0
ER  - 
%0 Journal Article
%A V. L. Kurakin
%T The Berlekamp–Massey algorithm over finite rings, modules and bimodules
%J Diskretnaya Matematika
%D 1998
%P 3-34
%V 10
%N 4
%U http://geodesic.mathdoc.fr/item/DM_1998_10_4_a0/
%G ru
%F DM_1998_10_4_a0

Voir la notice de l'article provenant de la source Math-Net.Ru

We give an algorithm for finding a monic polynomial of the least degree that generates a given sequence $u(0,l-1)$ of length $l$ with complexity $O(l^2)$ operations as $l\to\infty$. We consider the sequences $u(0,l-1)$ over a finite ring $R$ with identity, over a finite module $_R M$, or over finite bimodule $_A M_B$, where $A$ and $B$ are finite rings with identities.