The algebraic structure of repeated root cyclic codes

121 Views Asked by At

Is there a generator theory for repeated root cyclic codes over finite fields? In other words is the ring $GF(q)[x]/(x^n-1)$ principal when $(n,q)>1$?

1

There are 1 best solutions below

3
On

I think so. The ideals of $GF(q)[x]/(x^n-1)$ are in bijective correspondence with those ideals of the polynomial ring $GF(q)[x]$ that contain the polynomial $x^n-1$. The latter are all principal ideals, because all ideals of $GF(q)[x]$ are. Furthermore, the lowest degree non-zero polynomial still generates the ideal.