COMMUNICATION
On constacyclic codes over Z_p^m,
- IEEE, 2014, 5th Workshop on Codes, Cryptography and Communication Systems (WCCCS) : 55-58
Lien de l'article :
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7107919&i snumber=71078...
Discipline :
Mathématiques
Auteur(s) :
Mohammed Elhassani Charkani, Joël Kabore
Auteur(s) tagués :
KABORE Joël
Renseignée par : KABORE Joël
Résumé
Let p be a prime number, m = 2 a positive integer, and t a unit of R = Z_p^m, the ring of integers modulo p^m. Let
N = p^kn with gcd(p, n) = 1. In this work, we give a simple and short proof that the quotient ring R[X]I
is a principal ring. This allow us to study (1 + tp)-constacyclic codes of arbitrary length and give a characterization of self-dual (1 + tp) -constacyclic codes over Z_p^m.
Mots-clés
Chain ring, Constacyclic codes, Dual codes, self-dual codes