z-logo
open-access-imgOpen Access
$\mathbb{F}_{p^{m}}\mathbb{F}_{p^{m}}{[u^2]}$-additive skew cyclic codes of length $2p^s $
Author(s) -
Roghayeh Mohammadi Hesari,
Mahboubeh Hosseinabadi,
Rashid Rezaei,
Karim Samei
Publication year - 2022
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2022023
Subject(s) - mathematics , combinatorics , arithmetic
In this paper, we first study the skew cyclic codes of length \begin{document}$ p^s $\end{document} over \begin{document}$ R_3 = \mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}, $\end{document} where \begin{document}$ p $\end{document} is a prime number and \begin{document}$ u^3 = 0. $\end{document} Then we characterize the algebraic structure of \begin{document}$ \mathbb{F}_{p^{m}}\mathbb{F}_{p^{m}}[u^2] $\end{document} -additive skew cyclic codes of length \begin{document}$ 2p^s. $\end{document} We will show that there are sixteen different types of these codes and classify them in terms of their generators.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom