### Primitive Irreducible Polynomial

2 Let f(x) be a primitive irreducible polynomial of degree n over . Then each element Of can be expressed in the form with . Identify with the bit string which is the binary representation of , that is where each is 0 or 1. Let be the bit string identified with . Describe a simple procedure for obtaining f