Find a generator matrix and a check matrix for the cylic code
of the length
that is generated by
.
Prove, that
is irreducible in
.
Prove, that
is a primitive
-th root of unity over
.
Prove, that
holds.
Code
.
Solution
Polynomial division of
by
gives
.
Generator matrix and check matrix are
The polynomial
of degree
has no roots within
.
If it would be irreducible we could seperate a linear factor corresponding to a root. Therefore the polynomial is irreducible.
We get
From
we can see, that
must hold. We have
. The well known estimate for the minimal distance of cyclic codes gives us
. So
must hold.
It is
. Polynomial division by
gives the residue
. The code word to use is
.