Article ID Journal Published Year Pages File Type
4975921 Journal of the Franklin Institute 2010 12 Pages PDF
Abstract
Motivated by the work in [1] of Abualrub and Siap (2009), we investigate (1+λu)-constacyclic codes over Fp[u]/〈um〉 of an arbitrary length, where λ is a nonzero element of Fp. We find the generator polynomials of (1+λu)-constacyclic codes over Fp[u]/〈um〉, and determine the number of (1+λu)-constacyclic codes over Fp[u]/〈um〉 for a given length, as well as the number of codewords in each such code. Some optimal linear codes over F3 and F5 are constructed from (1+λu)-constacyclic codes over Fp+uFp under a Gray map.
Related Topics
Physical Sciences and Engineering Computer Science Signal Processing
Authors
, , ,