gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000011111101110010 a = 0x0000000000003f72 a = x¹³ + x¹² + x¹¹ + x¹⁰ + x⁹ + x⁸ + x⁶ + x⁵ + x⁴ + x
b = b0000000000000000000000000000000000000000000000000000000000101111 b = 0x000000000000002f b = x⁵ + x³ + x² + x + 1
11111101110010 | 101111 - 101111 | 1 -------------- | 1000001110010 | - 101111 | 1 -------------- | 11111110010 | - 000000 | 0 - 101111 | 1 -------------- | 1000010010 | - 101111 | 1 -------------- | 11100010 | - 000000 | 0 - 101111 | 1 -------------- | 1011110 | - 101111 | 1 -------------- | 0 | - 000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000110110110 c_quotient = 0x00000000000001b6 c_quotient = x⁸ + x⁷ + x⁵ + x⁴ + x² + x
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0