English

$(\sigma,\delta)$-polycyclic codes in Ore extensions over rings

Information Theory 2024-03-01 v2 math.IT

Abstract

In this paper, we study the algebraic structure of (σ,δ)(\sigma,\delta)-polycyclic codes, defined as submodules in the quotient module S/SfS/Sf, where S=R[x,σ,δ]S=R[x,\sigma,\delta] is the Ore extension ring, fSf\in S, and RR is a finite but not necessarily commutative ring. We establish that the Euclidean duals of (σ,δ)(\sigma,\delta)-polycyclic codes are (σ,δ)(\sigma,\delta)-sequential codes. By using (σ,δ)(\sigma,\delta)-Pseudo Linear Transformation, we define the annihilator dual of (σ,δ)(\sigma,\delta)-polycyclic codes. Then, we demonstrate that the annihilator duals of (σ,δ)(\sigma,\delta)-polycyclic codes maintain their (σ,δ)(\sigma,\delta)-polycyclic nature. Furthermore, we classify when two (σ,δ)(\sigma,\delta)-polycyclic codes are Hamming isometrical equivalent. By employing Wedderburn polynomials, we introduce simple-root (σ,δ)(\sigma,\delta)-polycyclic codes. Subsequently, we define the (σ,δ)(\sigma, \delta)-Mattson-Solomon transform for this class of codes and we address the problem of decomposing these codes by using the properties of Wedderburn polynomials.

Keywords

Cite

@article{arxiv.2312.07193,
  title  = {$(\sigma,\delta)$-polycyclic codes in Ore extensions over rings},
  author = {Maryam Bajalan and Ivan Landjev and Edgar Martínez-Moro and Steve Szabo},
  journal= {arXiv preprint arXiv:2312.07193},
  year   = {2024}
}

Comments

20 pages, no figure

R2 v1 2026-06-28T13:48:17.405Z