gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000010000000000000000 a = 0x00010000 a = x¹⁶
b = b00000000000000000000011111011101 b = 0x000007dd b = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
10000000000000000 | 11111011101 - 11111011101 | 1 ----------------- | 1111011101000000 | - 11111011101 | 1 ----------------- | 110011100000 | - 00000000000 | 0 - 00000000000 | 0 - 00000000000 | 0 - 11111011101 | 1 ----------------- | 1101011010 | - 00000000000 | 0
c_quotient = b00000000000000000000000001100010 c_quotient = 0x00000062 c_quotient = x⁶ + x⁵ + x
c_remainder = b00000000000000000000001101011010 c_remainder = 0x0000035a c_remainder = x⁹ + x⁸ + x⁶ + x⁴ + x³ + x