SKEW-CYCLIC LINEAR CODES OVER THE FINITE RING Rp = Fp[v1, v2, <middle dot><middle dot><middle dot>, vτ]/ (vi2=1, vivj - vjvi): AN IN-DEPTH EXPLORATION

This article introduces novel advancements in the realm of linear codes over the ring of integers modulo a prime, denoted as R-p = F-p[v(1), v(2), <middle dot> <middle dot> <middle dot> , v(tau)]/(v(i)(2) = 1, v(i)v(j) - v(j)v(i)), with tau >= 1, p = q(s) and q is an odd prime. Specifically, we present a new Gray map and Gray images tailored for linear codes over R-p, facilitating efficient representation and manipulation of these codes. Building upon this foundation, the study delves into the characterization and properties of skew cyclic codes over R-p, a class of linear codes with intriguing mathematical structures. The investigation of skew cyclic linear code properties reveals new insights into their algebraic properties. This work not only contributes to the theoretical understanding of linear and skew cyclic codes over R-p but also suggests practical implications for coding theory.