2000 character limit reached
$(1-2u^k)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_+u^{3}\mathbb{F}_{p}+\dots+u^{k}\mathbb{F}_{p}$
Published 8 Dec 2015 in cs.IT and math.IT | (1512.02332v2)
Abstract: Let $\mathbb{F}p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2uk)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u2\mathbb{F}_p+u{3}\mathbb{F}{p}+\cdots+u{k}\mathbb{F}_{p}$ where $u{k+1}=u$. We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.
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.