The Berlekamp–Massey algorithm will find the shortest linear feedback shift register (LFSR) for a given output sequence. It works for an arbitrary field, not only for a binary.
More info you can find here.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
The Berlekamp–Massey algorithm will find the shortest linear feedback shift register (LFSR) for a given output sequence. It works for an arbitrary field, not only for a binary.
More info you can find here.