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^2)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$ (1506.07273v1)

Published 24 Jun 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-2u2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u2\mathbb{F}_p$, where $u3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.

Citations (2)

Summary

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