Share
Explore BrainMass

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 from .
Prove your assertion.
Hint: Do some experimentation for small values of n

Please see the attached file for the fully formatted problems.

Attachments

Solution Summary

Primitive Irreducible Polynomials are investigated.

$2.19