(1 − 2u_2)-Constacylic Codes over F_p + uF_p + u^2F_p

Authors

  • Hojjat Mostafanasab Department of Mathematics and Applications, University of Mohaghegh Ardabili, P. O. Box 179, Ardabil, Iran.
  • Negin Karimi Department of Mathematics and Applications, University of Mohaghegh Ardabili, P. O. Box 179, Ardabil, Iran.

Keywords:

finite fields, cyclic codes, constacyclic codes

Abstract

Let F_p be a finite field, where p is an odd prime, and let u be an indeterminate. This article studies (1 − 2u^2)-constacyclic codes over the ring F_p + uF_p + u^2F_p, where u^3 = u. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.


Downloads

Published

2016-01-27

Issue

Section

Coding Theory and Cryptology

How to Cite

(1 − 2u_2)-Constacylic Codes over F_p + uF_p + u^2F_p. (2016). European Journal of Pure and Applied Mathematics, 9(1), 39-47. https://www.ejpam.com/index.php/ejpam/article/view/2571

Similar Articles

1-10 of 116

You may also start an advanced similarity search for this article.