期刊文献+

环F_(p^k)+uF_(p^k)+u^2F_(p^k)上的常循环码和循环码

Constacyclic and Cyclic Codes over F_(p^k) + uF_(p~κ)+u^2F_(p^k)
原文传递
导出
摘要 记环R=F_(p^k)+uF_(p^k)+u^2F_(p^k),定义了一个从R^n到F_(p^k)^(2np^k)的Gray映射.利用Gray映射的性质,研究了环R上(1-u^2)-循环码和循环码.证明了环R上码是(1-u^2)-循环码当且仅当它的Gray象是F_(p^k)上的准循环码.当(n,p)=1时,证明了环R上的长为n的线性循环码的Gray象置换等价于域F_(p^k)上的线性准循环码. F2npk Let R = Fpk + uFpk + u2Fpk, a Gray map from Rn to Fpk^2npk is defined. Base on the property of Gray map, (1 - u2)-cyclic and cyclic codes over R are studied. It is proved that a code over R is a (1 - u2)-cyclic code if and only if its Gray image is a quasi-cyclic code over Fpk. It is also proved that if (n,p) = 1, the Gray image of a linear cyclic code of length n over R is equivalent to a linear quasi-cyclic code over Fpk.
作者 梁华 唐元生
出处 《数学的实践与认识》 CSCD 北大核心 2012年第24期233-237,共5页 Mathematics in Practice and Theory
基金 国家自然科学基金(60971123)
关键词 线性码 循环码 常循环码 准循环码 GRAY映射 linear code cyclic code constacyclic code quasi-cyclic code gray map
  • 相关文献

参考文献5

  • 1Wolfmann J. Negacyclic and cyclic codes over[J]. IEEE Trans Inform Theory, 1999(45): 2527-2532.
  • 2Ling S, Blackford J. -linear codes[J]. IEEE Trans Inform Theory, 2002(45): 2592-2605.
  • 3Qian J F, Zhang L N, Zhu S X. constacyclic and cyclic codes over[J]. Appl Math Lett, 2006(19): 820-823.
  • 4Amarra M C V, MF2008F. R. Nemenzo, On -cyclic codes over[J]. Appl Math Lett, 21(2008) 1129- 1133.
  • 5QIAN Jian-fa, MA Wen-ping, Constacyclic and cyclic codes over finite chain rings[J]. The Journal of China Universities of Posts and Telecommunications. June 2009, 16(3): 122-125.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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