J4

• 数学 • 上一篇    下一篇

分圆数与一类二元循环码的最小距离

孙广人1, 胡万宝2   

  1. 1. 安庆师范学院 数学系, 安徽 安庆 246011; 2. 东南大学 移动通信国家重点实验室, 南京 210096
  • 收稿日期:2008-07-24 修回日期:1900-01-01 出版日期:2009-05-26 发布日期:2009-06-23
  • 通讯作者: 胡万宝

Cyclotomic Number and the Minimum Distance of a Class of Binary Cyclic Codes

SUN Guangren1, HU Wanbao2   

  1. 1. Department of Mathematics, Anqing Teachers College, Anqing 246011, Anhui Province, China; 2. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
  • Received:2008-07-24 Revised:1900-01-01 Online:2009-05-26 Published:2009-06-23
  • Contact: HU Wanbao

摘要: 使用分圆数讨论一类二元循环码重量为4的码字数的取 值, 给出了某些情况下有关最小距离猜测的3个初等判别准则及一个码字数A4只含有分圆数的计算公式.

关键词: 分圆数, 二元循环码, 最小距离

Abstract: The number of codewords with weight 4 in one open problem on a class of binary cyclic codes is discussed by means of cyclotomic numbers, three elementary rules of criterion on the open problem and a formula to compute A4 with only cyclotomic numbers involved is given under certain conditions.

Key words: cyclotomic numbers, binary cyclic codes, the minimum distance

中图分类号: 

  • O157.4