gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000011111011101 a = 0x00000000000007dd a = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
b = b0000000000000000000000000000000000000000000000000000001001001100 b = 0x000000000000024c b = x⁹ + x⁶ + x³ + x²
11111011101 | 1001001100 - 1001001100 | 1 ----------- | 1101000101 | - 1001001100 | 1 ----------- | 100001001 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000011 c_quotient = 0x0000000000000003 c_quotient = x + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000100001001 c_remainder = 0x0000000000000109 c_remainder = x⁸ + x³ + 1