English

Generator matrix for two-dimensional cyclic codes of arbitrary length

Commutative Algebra 2017-04-27 v1

Abstract

Two-dimensional cyclic codes of length n=sn=\ell s over the finite field F\mathbb{F} are ideals of the polynomial ring F[x,y]<xs1,y1>\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}. The aim of this paper, is to present a novel method to study the algebraic structure of two-dimensional cyclic codes of any length n=sn=\ell s over the finite field F\mathbb{F}. By using this method, we find the generator polynomials for ideals of F[x,y]<xs1,y1>\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >} corresponding to two dimensional cyclic codes. These polynomials will be applied to obtain the generator matrix for two- dimensional cyclic codes.

Keywords

Cite

@article{arxiv.1704.08070,
  title  = {Generator matrix for two-dimensional cyclic codes of arbitrary length},
  author = {Zahra Sepasdar},
  journal= {arXiv preprint arXiv:1704.08070},
  year   = {2017}
}
R2 v1 2026-06-22T19:28:20.631Z