期刊文献+

On the Gray Images of Some Constacyclic Codes over Fp + uFp + u^2Fp

On the Gray Images of Some Constacyclic Codes over F_p+uF_p+u^2F_p
原文传递
导出
摘要 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+uF_p+u^2F_p and codes over Fp 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+uF_p+u^2F_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+uF_3+u^2F_3 are given. 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 Fp + uFp + u^2Fp and codes over Fp 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 + u2)-constacyclic code over Fp + uFp + u^2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from (1 + u + u2)-constacyclic codes over F3 + uF3 + u^2F3 are given.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2016年第3期842-849,共8页 系统科学与复杂性学报(英文版)
基金 supported by the National Natural Science Foundation of China under Grant No.61370089 the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University under Grant No.2014D04 the Natural Science Fund of Education Department of Anhui province under Grant No.KJ2013Z276 the Fundamental Research Funds of Hefei University under Grant No.10KY01ZD the Key construction discipline Funds of Hefei University under Grant No.2014XK08 the Natural Science Key Fund of Education Department of Anhui Province under Grant No.KJ2015A226
关键词 重根循环码 灰度图像 线性码 编码理论 奇素数 Constacyclic code, cyclic code, Gray map.
  • 相关文献

参考文献1

二级参考文献12

  • 1Wolfmann J, Negacyclic and cyclic codes over Z4, IEEE Trans. Inform. Theory, 1999, 45(7): 2527-2532.
  • 2Wolfmann J, Binary images of cyclic codes over Z4, IEEE Trans. Inform. Theory, 2001, 47(5): 1773-1779.
  • 3Ling S and Blackford J T, Zpk+1-linear codes, IEEE Trans. Inform. Theory, 2002, 48(9): 2592- 2605.
  • 4Abualrub T and Siap T, Constacyclic codes over F2 + uF2, J. Franklin Inst., 2009, 346(5): 520 529.
  • 5Amarra M C V and Nemenzo F R, On (1 - u)-cyclic codes over Fpk +UFpk, Applied Mathematics Letters, 2008, 21(11): 1129-1133.
  • 6Dinh H Q and L6pez-Permouth S R, Cyclic and negacyclic codes over finite chain rings, IEEE Trans. Inform. Theory, 2004, 50(8): 1728-1744.
  • 7Kai X S, Zhu S X, and Li P, (1+λu)-Constacyclic codes over Fp[U]/(um), J. Franklin Inst., 2010, 347(5): 751-762.
  • 8Yildiz B and Karadenniz S, Linear codes over IF2 + uF2 + UF2 + uUF2, Des. Codes Cryptogr., 2010, 54(1): 61-81.
  • 9Yildiz B and Karadenniz S, Self-dual codes over F2 + uF2 + uF2 + uuF2, J. Franklin Inst., 2010, 347(10): 1888-1894.
  • 10Yildiz B and Karadenniz S, Cyclic codes over F2 + uF2 +uF2 +uuF2, Des. Codes Cryptogr., 2011, 58(3): 221-234.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部