Answer

Correct Option: (ii) Generator polynomial

Explanation

Cyclic codes $(n,k)$ are ideals in $\mathbb{F}_2[x]/(x^n-1)$, generated by $g(x)$ dividing $x^n-1$. Codewords $c(x)=m(x)g(x)$. Generator $g(x)$ degree $n-k$, parity check $h(x)=(x^n-1)/g(x)$. Example Hamming (7,4) $g(x)=x^3+x+1$.

Not frequency response, trellis, Fourier.

Final Answer

Generator polynomial → Option (ii).