(σ,δ)-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 S/Sf, where S=R[x,σ,δ] is the Ore extension ring, f∈ S, and R 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…