Papers
Topics
Authors
Recent
Search
2000 character limit reached

$(1-2u^2)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$

Published 24 Jun 2015 in cs.IT and math.IT | (1506.07273v1)

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

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.