A class of constacyclic codes over \(\mathbb Z_{p^m}\) (Q982479): Difference between revisions
From MaRDI portal
Latest revision as of 23:35, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of constacyclic codes over \(\mathbb Z_{p^m}\) |
scientific article |
Statements
A class of constacyclic codes over \(\mathbb Z_{p^m}\) (English)
0 references
7 July 2010
0 references
This paper presents the structure of \((1+\lambda p)\)-constacyclic codes of length \(p^s\) over \(\mathrm{GR}(p^m,a)\) and determine the Hamming and homogeneous distances of all such constacyclic codes. Further, the authors have classified all \((1+\lambda p)\)-constacyclic codes over \(\mathbb Z_{p^m}\) of length \(N= p^sn\) (\(n\) prime to \(p\)) using the discrete Fourier transform. The last section deals with \((1+\lambda p)\)-constacyclic codes over \(\mathbb Z_{p^2}\) and their images under a generalization of the Gray map.
0 references
constacyclic codes
0 references
Galois rings
0 references
generator polynomials
0 references
discrete Fourier transform
0 references
0 references
0 references
0 references