Year: 2026
Type: article
Abstract: The study of linear and cyclic codes over some types of finite rings has enabled the development of highly efficient codes with optimal parameters. Due to the algebraic properties of these rings, error-correction algorithms can be well adapted to diverse noisy channels, enhancing real-time performance. Furthermore, by using ideals in polynomial rings, cyclic codes ensure that hardware implementation remains remarkably straightforward and fast. For these reasons, in this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}= \mathbb{Z} _{p}[u]/\left( f\left( u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) = u^{p}-u$, with $s\in \{0,1,\dots,p-1\}$.
Institution: Ovidius University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7160393828
