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.
-
Notifications
You must be signed in to change notification settings - Fork 0
linarkou/BerlekampMasseyAlgorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Java implementation of Berlekamp-Massey algorithm
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published