| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648480 | Discrete Mathematics | 2011 | 6 Pages |
Abstract
We introduce a Gray map from Fp+vFpFp+vFp to Fp2 and study (1−2v)(1−2v)-constacyclic codes over Fp+vFpFp+vFp, where v2=vv2=v. It is proved that the image of a (1−2v)(1−2v)-constacyclic code of length nn over Fp+vFpFp+vFp under the Gray map is a distance-invariant linear cyclic code of length 2n2n over FpFp. The generators of such constacyclic codes for an arbitrary length are determined and their dual codes are also discussed.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Shixin Zhu, Liqi Wang,