Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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}$ (1512.02332v2)

Published 8 Dec 2015 in cs.IT and math.IT

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.

Summary

We haven't generated a summary for this paper yet.