deletions | additions       diff --git a/bits3.tex b/bits3.tex  index 542d3b9..16c35d3 100644  --- a/bits3.tex  +++ b/bits3.tex 
...
Let us consider the vector $(0,1,1)\in (\Fb)^3$, associated to the polynomial $f=x^3+x+1$ as explained above.   We observe that this polynomial is irreducible.  We can construct a Linear Feedback Shift Register (LFSR) over three bits, using \textbf{using}  $f=x^3+x+1$. \\  First of all, we start with an initial vector called \emph{state}, for example $(1,0,1)$, inserting it in the following structure: 
...
\end{center}  We aim to compute the fourth bit, that is $x^3$, namely the element we indicated with $?$.  Since $x^3=x+1$, we said that we want to \textbf{use} the polynomial $f$, we actually consider   the portion of $f$ without its leading term $x^3$, that is, $f+x^3=x+1$.   We thus interpret $x+1$ as the following operation:  we sum the bits in positions $x$ and $1$, getting: $0+1=1$. We getting $0+1=1$, and we  insertnow  this new bit in the place of $?$ $?$.  \begin{center}