(1-2u2)-constacyclic codes over Fp+uFp+u2Fp
Abstract
Let Fp be a finite field and u be an indeterminate. This article studies (1-2u2)-constacyclic codes over the ring Fp+uFp+u2Fp, where u3=u. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.