期刊文献+

有限链环上的循环码及其Mattson-Solomn多项式 被引量:5

Cyclic codes and their Mattson-Solomn polynomials over finite chain rings
下载PDF
导出
摘要 研究了有限链环上的循环码的结构及其Mattson-Solomn多项式.用循环码的Mattson-Solomn多项式和定义集刻画循环码及其对偶码的性质. The structure of cyclic codes over finite chain rings is studied.Characteristics of cyclic codes and their dual codes are investigated using their Mattson-Solomn polynomials and defining sets.
出处 《高校应用数学学报(A辑)》 CSCD 北大核心 2004年第2期127-134,共8页 Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金 国家自然科学基金(19971096 90104035)
关键词 有限链环 循环码 对偶码 Mattson-Solomn多项式 finite chain ring cyclic code dual code Mattson-Solomn polynomial
  • 相关文献

参考文献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.

同被引文献47

  • 1钱建发,朱士信.F_2+uF_2+…+u^kF_2环上的循环码[J].通信学报,2006,27(9):86-88. 被引量:6
  • 2王冬银,朱士信.F_2+uF_2上长度为2n(n为奇数)的循环码个数[J].合肥工业大学学报(自然科学版),2006,29(11):1470-1472. 被引量:4
  • 3李平,朱士信.环F2+uF2上长为2^e的循环码[J].电子与信息学报,2007,29(5):1124-1126. 被引量:16
  • 4Blackford T. Cyclic codes over Z4 of oddly even length [ J ]. Discrete Applied Mathematics, 2003, 128 ( 1 ) : 27 - 46.
  • 5Dougherty S T, Ling S. Cyclic codes over Z4 of even length [ J ]. Design, Code, Cryptography, 2006, 39(2) : 127 - 153.
  • 6Qian J F, Zhang L N, Zhu S X. Cyclic codes over Fp + uFp+ …+ u^k-1Fp [ J ]. IEICE Transactions of Fundamentals, 2005, E88- A: 795- 797.
  • 7Bachoc C. Application of coding theory to the construction of modular lattices[J]. J. Combin. Theory Set. A, 1997, 78(1): 92-119.
  • 8Udaya 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.
  • 9Qian 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.
  • 10Ozen 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.

引证文献5

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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