gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000100001100111 a = 0x0000000000000867 a = x¹¹ + x⁶ + x⁵ + x² + x + 1
b = b0000000000000000000000000000000000000000000000000000011111011101 b = 0x00000000000007dd b = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
100001100111 | 11111011101 - 11111011101 | 1 ------------ | 11111011101 | - 11111011101 | 1 ------------ | 0 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000011 c_quotient = 0x0000000000000003 c_quotient = x + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0