English

On the structure of $1$-generator quasi-polycyclic codes over finite chain rings

Information Theory 2021-11-10 v1 math.IT

Abstract

Quasi-polycyclic (QP for short) codes over a finite chain ring RR are a generalization of quasi-cyclic codes, and these codes can be viewed as an R[x]R[x]-submodule of Rm\mathcal{R}_m^{\ell}, where Rm:=R[x]/f\mathcal{R}_m:= R[x]/\langle f\rangle, and ff is a monic polynomial of degree mm over RR. If ff factors uniquely into monic and coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials and the minimal generating sets of 1-generator QP codes as RR-modules. In addition, we also determine the parity check polynomials for these codes by using the strong Gr\"{o}bner bases. In particular, via Magma system, some quaternary codes with new parameters are derived from these 1-generator QP codes.

Keywords

Cite

@article{arxiv.2111.04914,
  title  = {On the structure of $1$-generator quasi-polycyclic codes over finite chain rings},
  author = {Rongsheng Wu and Minjia Shi and Patrick Solé},
  journal= {arXiv preprint arXiv:2111.04914},
  year   = {2021}
}