Consider the 4-bit LFSR-based pseudo-random sequence generator of Figure 4.31. Starting with “1111”,


Consider the 4-bit LFSR-based pseudo-random progression generator of Figure 4.31. Starting with "1111", roll the corresponding progression of values that it produces, and so warrant that it verily contains 2N – 1 plain states.