期刊文献+

环Fq+uFq+…+u^k-1Fq上一类重根常循环码 被引量:14

A Class of Repeated-root Constacyclic Codes over the Ring F_q+uF_q+…+u^(k-1)F_q
下载PDF
导出
摘要 记R=F_q+uF_q+…+u^(k-1)F_q,G=R[x]/<x^t-α>,且λ是R中可逆元。定义了从G^n到R^tn的新的Gray映射φ,证明了J是G上长为n的线性的x-常循环码当且仅当φ(J)是R上长为tn的线性的α-常循环码。使用有限环理论,获得了环R上长为p^e的所有的(uλ-1)-常循环码的结构及其码字个数。特别地,获得了环F2m+uF上长为2~e的(uλ-1)-常循环码的对偶码的结构及其码字个数。推广了环2aZ上重根负循环码的若干结果。 Let R=Fq+uFq+…+uk-1Fq,G=R[x]/〈 x^t -α 〉, and A be an invertible element in R. A new Gray map φ from G^n to R^tn is defined. It is proved that J is a linear x -constacyclic code of length n if and only if φ(J) is a linear α-constacyclic code over R of length tn. By means of the theory of finite rings the structure and sizes of all (uλ- 1) -constacyclic codes over R of length p^e are obtained. Especially, the structure and sizes of the duals of all (uλ - 1) -constacyclic codes of length 2^e over the ring F2m+uF2m are also obtained. Some of the results about repeated-root negacyclic codes over the ring Z2h are generalized.
出处 《电子与信息学报》 EI CSCD 北大核心 2008年第6期1394-1396,共3页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60673074) 教育部科学技术研究重点项目(107065) 安徽省高校青年教师科研资助计划重点项目(2006jql002zd) 合肥工业大学科研发展基金项目(061003F)资助课题
关键词 重根常循环码 GRAY映射 极大理想 有限链环 Repeated-root constacyclic codes Gray map Maximal ideal Finite chain rings
  • 相关文献

参考文献22

  • 1Bachoc C. Application of coding theory to the construction of modular lattices[J]. J. Combin. Theory Set. A, 1997, 78(1): 92-119.
  • 2Udaya P and Siddiqi M U. Optimal large linear complexity frequency hopping patterns derived from polynomial residue rings[J]. IEEE Trans. on Inform. Theory, 1998, 44(4): 1492-1503.
  • 3Qian J F and Zhu S X. Cyclic codes over Fp+uFp+…+u^k-1Fp[J].IEICE Trans. on Fundamentals,2005, E88-A(3): 795-797.
  • 4Ozen M and Siap I. Linear codes over Fq[u]/< u^s > withrespect to the Rosenbloom-Tasfasman Metric[J]. Designs, Codes and Crypt, 2006, 38(1): 17-29.
  • 5Ling S and Sole P. Duadic codes over F2+uF2 [J]. Applicable Algebra in Engineering, Communication and Computing, 2001, 2(12): 365-379.
  • 6Siap I. Linear codes over F2 + uF2 and their complete weight enumerators [J]. Codes and Designs, Ohio State Univ. Math Res. Inst. Publ. 2000, 10(1): 259-271.
  • 7Bonnecaze A and Udaya P. Cyclic codes and serf-dual codes over F2 + uF2 [J]. IEEE Trans. on Inform. Theory, 1999, 45(5): 1250-1255.
  • 8Gulliver T A and Harada M. Construction of optimal Type IV self-dual codes over F2 +uF2 [J]. IEEE Trans. on Inform. Theory, 1999, 45(7): 2520-2521.
  • 9Dougherty S T, Gaborit P, and Harada M, et al. Type II codes over F2 + uF2 [J]. IEEE Trans. on Inform. Theory, 1997, 50(8): 1728-1744.
  • 10Massey J L and Justesen C. Polynomial weights and code constructions[J]. IEEE Trans. on Inform. Theory, 1973, 19(1): 101-110.

二级参考文献12

  • 1Hammons A R,Kumar P V Jr,Calderbank A R,et at. The Z4 linearity of Kerdock,Preparata,Goethals ,and related codes[J]. IEEE Trans. Inform. Theory, 1994,40(2):301-319.
  • 2Pless V ,Sole P,Qian Z. Cyclic self-dual Z4-codes[J]. Finite Fields Appl.,1997,3:48-69.
  • 3Calderbank A R, McGuire G,Kumar P V,et al. Cyclic codes over Z4,1ocator polynomials and Newton's identities [J]. IEEE Trans. Inform. Theory, 1996,42(1): 217-226.
  • 4Kanwar P,Lopez-Permouth S R. Cyclic codes over the integers modulo p111[J]. Finite Fields Appl.,1997(3): 334-352.
  • 5Calderbank A R, Sloane N J A. Modular and p-adic cyclic codes[J]. Designs, Codes and Cryptography, 1995,6:21-35.
  • 6Blackford J T,Ray-Chaudhuri D K. A transform approach to permutation groups of cyclic codes over Galois rings[J]. IEEE Trans. Inform. Theory, 2000,46(7): 2350-2358.
  • 7Bonnecaze A,Udaya P. Cyclic codes and self-dual codes over F2+uF2[J]. IEEE Trans. Inform.Theory, 1999,45 (4): 1250-1255.
  • 8Dougherty S T,Gaborit P,Harada M,et al. Type Ⅱ codes over F2+uF2[J]. IEEE Trans. Inform.Theory, 1999,45(1): 32-45.
  • 9Udaya P,Siddiqi M R. Optimal large linear complexity frequency hoping patterns derived from polynomial resideue class rings[J]. IEEE Trans. Inform. Theory, 1998,44(4) :1492-1503.
  • 10Norton G H,Salagean A. On the structure of linear and cyclic codes over a finite chain ring[J].Appl. Algebra. Eng. Comm. Comput.,2000,10: 489-506.

共引文献4

同被引文献112

  • 1钱建发,朱士信.F_2+uF_2+…+u^kF_2环上的循环码[J].通信学报,2006,27(9):86-88. 被引量:6
  • 2李平,朱士信.环F2+uF2上长为2^e的循环码[J].电子与信息学报,2007,29(5):1124-1126. 被引量:16
  • 3Hammons A R, Kumar P V, Calderbank A R, et al. The Z4-1inearity of Kerdock, Preparata, Goethals, and related code[J]. IEEE Trans Inform Theory, 1994, 40 (2): 301--319.
  • 4Wolfmann J. Binary images of cyclic codes over Z4 [J]. IEEE Trans Inform Theory, 2001, 47 (5) : 1773--1779.
  • 5Wolfmann J. Negacyclic and cyclic codes over Z4[J].IEEE Trans Inform Theory, 1999, 45 (7) :2527--2532.
  • 6Carlet C. Z2^k-linear codes[J]. IEEE Trans IT, 1998, 44 (4):1543--1547.
  • 7Tapia-Recillas H, Vega G. Some constaeyelic codes over Z2^k and binary quasi-cyclic codes[J]. Discrete Applied Mathematics, 2003,128(1) : 305 -- 316.
  • 8Greferath M, Sehrnidt S E. Gray isometries for finite chain rings[J]. IEEE Trans Inform Theory, 1999, 45 (7): 2522--2524.
  • 9Gulliver T A, Harada M. Codes over F3 +uF3 and improvements to the bounds on ternary linear codes[J]. Designs, Codes and Crypt,2001,22(1):89--96.
  • 10Nechaev A A. Kerdock codes in a cyclic form[J]. Discrete Math Appli, 1991,16(1) :365--384.

引证文献14

二级引证文献36

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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