ﻻ يوجد ملخص باللغة العربية
In this paper, we study the $sigma$-self-orthogonality of constacyclic codes of length $p^s$ over the finite commutative chain ring $mathbb F_{p^m} + u mathbb F_{p^m}$, where $u^2=0$ and $sigma$ is a ring automorphism of $mathbb F_{p^m} + u mathbb F_{p^m}$. First, we obtain the structure of $sigma$-dual code of a $lambda$-constacyclic code of length $p^s$ over $mathbb F_{p^m} + u mathbb F_{p^m}$. Then, the necessary and sufficient conditions for a $lambda$-constacyclic code to be $sigma$-self-orthogonal are provided. In particular, we determine the $sigma$-self-dual constacyclic codes of length $p^s$ over $mathbb F_{p^m} + u mathbb F_{p^m}$. Finally, we extend the results to constacyclic codes of length $2 p^s$.
Let $mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $mathcal{R}=mathbb{F}_p+umathbb{F}_p+u^2mathbb{F}_p+u^{3}mathbb{F}_{p}+cdots+u^{k}mathbb{F}_{p}$ where $u^{k+1}=u$. We i
In this paper, we give conditions for the existence of Hermitian self-dual $Theta-$cyclic and $Theta-$negacyclic codes over the finite chain ring $mathbb{F}_q+umathbb{F}_q$. By defining a Gray map from $R=mathbb{F}_q+umathbb{F}_q$ to $mathbb{F}_{q}^{
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In many cases, BCH codes are the best linear codes. However, the dimension and minimum distance of BCH codes have been seldom solved. Until no
Let $mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=mathbb{F}_{2^m}[u]/langle u^krangle=mathbb{F}_{2^m}+umathbb{F}_{2^m}+ldots+u^{k-1}mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $kgeq 2$. For any odd positive integer $
We study the mod-p cohomology of the group Out(F_n) of outer automorphisms of the free group F_n in the case n=2(p-1) which is the smallest n for which the p-rank of this group is 2. For p=3 we give a complete computation, at least above the virtual