# Generator polynomials and generator matrix for quasi cyclic codes

## TL;DR

This paper investigates quasi-cyclic codes over finite fields, introducing a new method to determine generator polynomials and matrices, thereby enhancing the algebraic understanding and construction of these codes.

## Contribution

It presents a novel approach to find generator polynomials and matrices for QC codes, expanding the algebraic tools available for their analysis.

## Key findings

- New method for generator polynomial determination
- Explicit construction of generator matrices for QC codes
- Enhanced algebraic framework for QC code analysis

## Abstract

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{< x^s-1,y^{\ell}-1 >}$. The aim of the present paper, is to study QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ and find generator polynomials and generator matrix for these codes. To achieve this aim, we apply a novel method to find generator polynomials for $\mathbb{F}[y]$-submodules of $\frac{\mathbb{F}[x,y]}{< x^s-1,y^{\ell}-1 >}$. These polynomials will be applied to obtain generator matrix for corresponding QC codes.