(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

Vol. 9 No. 1: (January 2016)

Section

Coding Theory and Cryptology

License

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

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