GF(2)上一类多项式因式分解及算法实现  

The Factoring of Polynomials over GF(2)and Algorithm Implementation

作　　者：陈威[1] 徐四林[1] 

机构地区：[1]解放军理工大学气象学院研究生14队,江苏南京211101

出　　处：《微机发展》2003年第2期71-72,79,共3页Microcomputer Development

摘　　要：循环码在信道编码中起着非常重要的作用 ,它构造简单、易于实现 ,可通过xn- 1的既约多项式构造出来。介绍了将GF(2 )上xn - 1型多项式分解为既约多项式的方法 ,并给出了具体的实现方法。实验表明此算法实现简单 ,有很高的实用价值。Cyclic code is very important to the research on the channel coding. It is not only simple in the structure,but also feasible.It can be constructed by the irreducible polynomials of x n-1.Introduces the methods of factoring polynomials like x n-1 over GF(2),and gives an algorithm to implement it. The results show that this algorithm is simple and very valuable to the practice.

关 键 词：多项式 因式分解 算法 信道编码 循环码 既约多项式 

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