// output of ./demo/gf2n/normalpoly-dual-demo.cc: // Description: //% Find all normal binary polynomials of degree n and their duals. arg 1: 9 == n [Degree of the polynomials] default=9 arg 2: 1 == wh [What to print: 0==> nothing (just count), 1==> binary polynomials and ntrace(), 2==> polynomials.] default=1 arg 3: 0 == sd [Whether to skip polynomials that are not self-dual] default=0 1: C=11..11...1 T=.11....111 P Cs=1111.1.1.1 D=.1.1111.11 2: C=11...1..11 T=.1..11..11 P Cs=111....1.1 D=..111111.1 3: C=11111...11 T=.1.1111.11 P Cs=11..111.11 D=.11....111 4: C=11.11.1.11 T=..1.11.1.1 P Cs=1111111.11 D=.111..1111 5: C=111....1.1 T=..111111.1 P Cs=11...1..11 D=.1..11..11 6: C=111...1111 T=..111111.1 P Cs=11...1.1.1 D=.1..11..11 7: C=11.......1 T=.11....111 Cs=1111.11..1 D=.1.1111.11 8: C=11.111..11 T=.........1 P S Cs=11.111..11 D=.........1 9: C=1111.1.1.1 T=.1.1111.11 P Cs=11..11...1 D=.11....111 10: C=1111..1.11 T=.111..1111 P Cs=11.1.11.11 D=..1.11.1.1 11: C=11.1.11.11 T=..1.11.1.1 P Cs=1111..1.11 D=.111..1111 12: C=11.1..1..1 T=.........1 S Cs=11.1..1..1 D=.........1 13: C=1111111.11 T=.111..1111 P Cs=11.11.1.11 D=..1.11.1.1 14: C=1111...111 T=.111..1111 P Cs=11.11.11.1 D=..1.11.1.1 15: C=11...1.1.1 T=.1..11..11 P Cs=111...1111 D=..111111.1 16: C=11.1..1111 T=.........1 P S Cs=11.1..1111 D=.........1 17: C=11...11111 T=.1..11..11 P Cs=111.111..1 D=..111111.1 18: C=111.111..1 T=..111111.1 P Cs=11...11111 D=.1..11..11 19: C=1111.11..1 T=.1.1111.11 P Cs=11.......1 D=.11....111 20: C=11..111.11 T=.11....111 P Cs=11111...11 D=.1.1111.11 21: C=11.11.11.1 T=..1.11.1.1 P Cs=1111...111 D=.111..1111 n=9 #= 21 #P = 19 #N = 2 #S = 3 #SP = 2