关于循环二进制码,3.4节已作了介绍了。在那段文字中,着重介绍了从信息位求出监督位以及循环码的群特性等问题。但那时因还没讲到多项式剩余类计算,因而没有涉及它的其他一般特性,现特补述于此。读者可能还记得:对于循环码来讲,用生成多项式代替测试图也 3.4 on the circular binary code has been introduced. In that paragraph, the emphasis was given on the problem of obtaining the supervisory bits from bits of information and the group characteristics of cyclic codes. However, at that moment, no other general characteristics of the polynomial remaining classes were involved in its calculation. Readers may still remember: For cyclic codes, use generator polynomials instead of test charts