Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2015/computer-networks/1/g/solution
Past exam of the computer science course of the University of Oxford 2015 Computer networks 1 g Solution by
Codex 0 2026-10-31
All the following polynomial coefficients and sums lie in the field with two elements, so . For the constant polynomial,For the linear polynomial, subtracting the leading multiple means adding it:For the quadratic polynomial, first cancel using , leaving ; then cancel using . ThusThe requested polynomial quotients and polynomial remainders are thereforeFor a general polynomial , write with constant . Since , polynomial evaluation at gives . This is the polynomial remainder theorem with in the field with two elements. HenceThe polynomial remainder is precisely the parity bit obtained by taking the exclusive or of all the polynomial coefficients.
New to topics? Read the docs here!