gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000000100000000
a = 0x00000100
a = x
8
b = b00000000000000000000000011000001
b = 0x000000c1
b = x
7
+ x
6
+ 1
100000000 | 11000001 - 11000001 | 1 --------- | 10000010 | - 11000001 | 1 --------- | 1000011 |
c
quotient
= b00000000000000000000000000000011
c
quotient
= 0x00000003
c
quotient
= x + 1
c
remainder
= b00000000000000000000000001000011
c
remainder
= 0x00000043
c
remainder
= x
6
+ x + 1