Question: Suppose we build an LFSR machine that works mod 3 instead of mod 2. It uses a recurrence of length 2 of the form x
Suppose we build an LFSR machine that works mod 3 instead of mod 2. It uses a recurrence of length 2 of the form
xn+2 c0xn + c1xn+1 mod 3
to generate the sequence 1, 1, 0, 2, 2, 0, 1, 1. Set up and solve the matrix equation to find the coefficients c0 and c1.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
