Abstract | ||
---|---|---|
Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over F p + u F p + u 2 F p and codes over F p is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear (1+u+u 2)-constacyclic code over F p + u F p + u 2 F p of length n is a repeated-root cyclic code over F p of length pn. Furthermore, some examples of optimal linear cyclic codes over F 3 from (1 + u + u 2)-constacyclic codes over F 3 + u F 3 + u 2 F 3 are given. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/s11424-015-4316-5 | J. Systems Science & Complexity |
Keywords | DocType | Volume |
Constacyclic code, cyclic code, Gray map | Journal | 29 |
Issue | ISSN | Citations |
3 | 1559-7067 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Haifeng Yu | 1 | 0 | 0.34 |
Shixin Zhu | 2 | 216 | 37.61 |
Xiaoshan Kai | 3 | 50 | 4.29 |