秩距离BCH码的进一步研究  

Further research on rank distance BCH codes

作　　者：杜伟章[1,2] 陈克非[1] 

机构地区：[1]上海交通大学计算机科学与工程系 [2]长沙交通学院计算机工程系,湖南长沙410076

出　　处：《通信学报》2002年第11期92-95,共4页Journal on Communications

基　　金：国家自然科学基金资助项目(69973031)

摘　　要：本文作者在“关于秩距离BCH码的校验矩阵及其秩距离”一文中提出了秩距离BCH码的概念,讨论了所给秩距离BCH码为最大秩距离BCH码时,码的生成多项式的根应满足的条件。本文在此基础上,讨论当线性秩距离码的生成多项式具有广义连续根时,它能构成秩距离BCH码的充分条件并给出了此充分条件。The concept of rank distance BCH code was proposed by the first author of this paper in the paper of Parity check matrices and rank distance of rank distance BCH codes. When the given rank distance BCH code is maximum rank distance BCH code, the condition that roots of generator polynomial must satisfy was discussed in that paper. In this paper, provided that generator polynomial of a given linear rank distance code possesses generalized continuous roots set, the sufficient condition that makes the given linear rank distance code forming rank distance BCH code is discussed. The sufficient condition is given also.

关 键 词：BCH码 秩距离码 生成多项式 广义连续根 

分 类 号：TN911.2[电子电信—通信与信息系统]