|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
Re: (tye)Re: LFSR golfby Adam (Vicar) |
| on May 08, 2001 at 11:22 UTC ( [id://78795]=note: print w/replies, xml ) | Need Help?? |
This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.
Perhaps a more interesting challange would be an implementation of the Berlkamp-Massey algorithm. This algorithm capitalizes on knowing some series of bits produced by the LFSR (at least 2N bits, where N is the number of bits in the register) and determining what the taps are.
In Section
Meditations
|
|
||||||||||||||||||||||||