<s>
The	O
Berlekamp	B-Algorithm
–	I-Algorithm
Massey	I-Algorithm
algorithm	I-Algorithm
is	O
an	O
algorithm	O
that	O
will	O
find	O
the	O
shortest	O
linear-feedback	B-Architecture
shift	I-Architecture
register	I-Architecture
(	O
LFSR	B-Architecture
)	O
for	O
a	O
given	O
binary	O
output	O
sequence	O
.	O
</s>
<s>
The	O
field	O
requirement	O
means	O
that	O
the	O
Berlekamp	B-Algorithm
–	I-Algorithm
Massey	I-Algorithm
algorithm	I-Algorithm
requires	O
all	O
non-zero	O
elements	O
to	O
have	O
a	O
multiplicative	O
inverse	O
.	O
</s>
<s>
James	O
Massey	O
recognized	O
its	O
application	O
to	O
linear	B-Architecture
feedback	I-Architecture
shift	I-Architecture
registers	I-Architecture
and	O
simplified	O
the	O
algorithm	O
.	O
</s>
<s>
Massey	O
termed	O
the	O
algorithm	O
the	O
LFSR	B-Architecture
Synthesis	O
Algorithm	O
(	O
Berlekamp	O
Iterative	O
Algorithm	O
)	O
,	O
but	O
it	O
is	O
now	O
known	O
as	O
the	O
Berlekamp	B-Algorithm
–	I-Algorithm
Massey	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
The	O
Berlekamp	B-Algorithm
–	I-Algorithm
Massey	I-Algorithm
algorithm	I-Algorithm
is	O
an	O
alternative	O
to	O
the	O
Reed	B-Error_Name
–	I-Error_Name
Solomon	I-Error_Name
Peterson	O
decoder	O
for	O
solving	O
the	O
set	O
of	O
linear	O
equations	O
.	O
</s>
