选择5阶本原多项式:x^5 + x^2 + 1,初始值为{1,0,0,1,1},易得,递推公式为:ak = ak-5 ⊕ ak-2 ,其中k≥5。于是可以写出下面这段代码:
java">class BitsEncode {public static void main(String[] args) {//初始化数组int a[] = {1,0,0,1,1};//获取前100位for(int i=0;i<100;i++){System.out.print(a[0]);int temp1 = a[0];int temp2 = a[3];a[0] = a[1];a[1] = a[2];a[2] = a[3];a[3] = a[4];a[4] = (temp1+temp2) > 1 ? 0 : (temp1+temp2);//换行更加清晰地显示周期if((i+1) % 31 == 0){System.out.println();}}}
}
输出如下: