期刊文献+

一些不可约循环码的权重分布

The weight distribution of some irreducible cyclic codes
原文传递
导出
摘要 令n为qm-1的正因子.本文主要借助特征标、分圆类及Gauss周期的知识确定了GF(q)上码长为n、维数为m的不可约循环码在一些特殊情形下的权重分布,这些不可约循环码为二权、三权或是四权码. In this paper,n is a positive integer dividing qm -1.The weight distribution of the irreducible cyclic codes over GF(q) with length n and dimension m is settled for a few special cases by characters,cyclotomy classes and Gaussian periods.These irreducible cyclic codes have two weights or three weights or four weights.
出处 《中国科学:数学》 CSCD 北大核心 2011年第10期877-884,共8页 Scientia Sinica:Mathematica
基金 国家自然科学基金(批准号:10771051和10971049)资助项目
关键词 循环码 GAUSS和 权分配 cyclic code Gaussian sum weight distribution
  • 相关文献

参考文献10

  • 1Lidl L, Niederreiter H. Finite Fields. Cambridge: Cambridge University Press, 1997.
  • 2MacWilliams F, Seery J. The weight distributions of some minimal cyclic codes. IEEE Trans Inform Theory, 1981, 27: 796-806.
  • 3Delsarte P, Goethals J M. Irreducible binary cyclic codes of even dimension. In: Proc Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications. Chapel Hill: Univ North Carolina, 1970, 100- 113.
  • 4McEliece R J. A class of two-weight codes. J P L Space Programs Summary 37-41, 1966, IV: 264-266.
  • 5Baumert L D, McEliece R J. Weights of irreducible cyclic codes. Inform Control, 1972, 20:158-175.
  • 6Baumert L D, Mykkeltveit J. Weight distributions of some irreducible cyclic codes. DSN Progress Report, 1973, 16: 128-131.
  • 7Moisio M J, Vaananen K O. Two recursive algorithms for computing the weight distribution of certain irreducible cyclic codes. IEEE Trans Inform Theory, 1999, 45:1244-1249.
  • 8Ding C. The weight distribution of some irreducible cyclic codes. IEEE Trans Inform Theory, 2009, 55:955-960.
  • 9Myerson G. Period polynomials and Gauss sums for finite fields. Acta Arith, 1981, 39:251-264.
  • 10Schroof R. Families of curves and weight distribution of codes. Bull Amer Math Soc, 1995:171-183.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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