For example, we can represent the bit pattern 111 by the poly-

nomial x2 +x+1. On the other hand, the bit pattern 101 would
be represented by the polynomial x2 + 1 and the pattern 011 by
the polynomial x + 1. Since all the bits in 111 are set, we have
all powers of x up to 2 in the corresponding polynomial. On the
other hand, in the bit pattern 101, the second bit is not set, so
the coefficient of x in the polynomial is zero, which results in the
polynomial x2 + 1. Finally, in the bit pattern 011, since only the
two least significant bits are set, the polynomial becomes x + 1.
As you will see in this lecture, this ploy of represent-
ing a bit pattern with a polynomial will allow us to
create a finite field with bit patterns.
• In general, a polynomial is an expression of the form
anxn + an−1xn−1 + ...... + a1x + a0