Matrix-product structure of repeated-root cyclic codes over finite fields

A matrix-product structure for repeated-root cyclic codes over finite fields is explored. Using this, some properties such as minimum distance and duality for these codes are rediscovered. Finally, a decoding algorithm is presented for this class of codes and the algorithm is modified and adapted for the binary repeated-root cyclic codes of length 2k2k.