Cyclic codes

A cyclic code is associated to an irreducible polynomial over $\mathbb{F}$ which divides $x^n-1$.

For example, to get the $[7,4,3]$ cyclic code over $GF(2)$ having generator matrix

$$\left( \begin{array}{ccccccc} 1& 0& 0& 0& 1& 1& 0\\ 0& 1& 0... ... 0& 0& 1& 0& 1& 1& 1\\ 0& 0& 0& 1& 1& 0& 1 \end{array}\right)$$

R:=PolynomialRing(GF(2),["x"]);;
x:=Indeterminate(GF(2),"x");;
g:=x^3+x+1;
Factors(x^7-1);
C:=GeneratorPolCode(g,7,GF(2));
G:=GeneratorMat(C);

To get the parity check matrix, type H:=CheckMat(C); Try IsCyclicCode(C);

To get the dimension of the code, type Dimension(C); To get its minimum distance, type MinimumDistance(C);

Exercise 3.11.6   Check if $x^2+1$ is a generating polynomial of a cyclic code of length $4$ over $GF(2)$. If so, find a basis for this code, as a vector space over $GF(2)$, and construct a parity check matrix.