g$($x$)$ generating polynom of cyclic code C with odd length n

C$($x$)$ polynom of word code suitable for code

C$=(C_{n-1},C_{n-2},....C_n)$

look at polynom

Z$($x$)=$ C$(x^2)$mod$(x^n+1)$

define in the simplest way the bit of

Z$=(Z_{n-1,}{Z}_{n-2},....,Z_0)$ by bits of C

the answer should be as:

$Z_{n-2}=$

$Z_{n-1}=$

$Z_0=$