For n-bit LFSR, the longest possible sequence is given by

1.	For n-bit LFSR, the longest possible sequence is given by
A.	2<sup>n</sup>
B.	2<sup>n</sup> + 1
C.	2<sup>n</sup>‚Äö√Ñ√∂‚àö√ë‚àö¬® 1
D.	1/2<sup>n</sup>
Answer» D. 1/2<sup>n</sup>

Discussion