gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000100000000000000 a = 0x00004000 a = x¹⁴
b = b00000000000000000000011111011101 b = 0x000007dd b = x¹⁰ + x⁹ + x⁸ + x⁷ + x⁶ + x⁴ + x³ + x² + 1
100000000000000 | 11111011101 - 11111011101 | 1 --------------- | 11110111010000 | - 11111011101 | 1 --------------- | 1100111000 | - 00000000000 | 0 - 00000000000 | 0 - 00000000000 | 0
c_quotient = b00000000000000000000000000011000 c_quotient = 0x00000018 c_quotient = x⁴ + x³
c_remainder = b00000000000000000000001100111000 c_remainder = 0x00000338 c_remainder = x⁹ + x⁸ + x⁵ + x⁴ + x³