gf(2) mod
c = a % b
Calculate c = a/b, result is c
remainder
gf(2) Polynomial long division
c = a/b
a = b00000000000000000000010000000000
a = 0x00000400
a = x
10
b = b00000000000000000000011111011101
b = 0x000007dd
b = x
10
+ x
9
+ x
8
+ x
7
+ x
6
+ x
4
+ x
3
+ x
2
+ 1
10000000000 | 11111011101 - 11111011101 | 1 ----------- | 1111011101 |
c
quotient
= b00000000000000000000000000000001
c
quotient
= 0x00000001
c
quotient
= 1
c
remainder
= b00000000000000000000001111011101
c
remainder
= 0x000003dd
c
remainder
= x
9
+ x
8
+ x
7
+ x
6
+ x
4
+ x
3
+ x
2
+ 1