$(\sigma,\delta)$-polycyclic codes in Ore extensions over rings
Abstract
In this paper, we study the algebraic structure of -polycyclic codes, defined as submodules in the quotient module , where is the Ore extension ring, , and is a finite but not necessarily commutative ring. We establish that the Euclidean duals of -polycyclic codes are -sequential codes. By using -Pseudo Linear Transformation, we define the annihilator dual of -polycyclic codes. Then, we demonstrate that the annihilator duals of -polycyclic codes maintain their -polycyclic nature. Furthermore, we classify when two -polycyclic codes are Hamming isometrical equivalent. By employing Wedderburn polynomials, we introduce simple-root -polycyclic codes. Subsequently, we define the -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