Constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Abstract: Let $\mathbb{F}{pm}$ be a finite field of cardinality $pm$ and $R=\mathbb{F}{pm}[u]/\langle u2\rangle=\mathbb{F}{pm}+u\mathbb{F}{pm}$ $(u2=0)$, where $p$ is a prime and $m$ is a positive integer. For any $\lambda\in \mathbb{F}_{pm}{\times}$, an explicit representation for all distinct $\lambda$-constacyclic codes over $R$ of length $psn$ is given by a canonical form decomposition for each code, where $s$ and $n$ are positive integers satisfying ${\rm gcd}(p,n)=1$. For any such code, using its canonical form decomposition the representation for the dual code of the code is provided. Moreover, representations for all distinct negacyclic codes and their dual codes of length $psn$ over $R$ are obtained, and self-duality for these codes are determined. Finally, all distinct self-dual negacyclic codes over $\mathbb{F}_5+u\mathbb{F}_5$ of length $2\cdot 5s\cdot 3t$ are listed for any positive integer $t$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.