Error-Detecting Codes (CRC)
Suppose error occurs i.e., T(x) + E(x). Each 1 bit in E(x) is an error.
A single burst error is indicated by 1xxxxx1 where xxxx could be any combination of 0’s and 1’s.
Receiver does [T(x) + E(x)]/G(x). What is left is E(x)/G(x).
If E(x) = x^i, i shows which bit is in error then if G(x) has >= 2 terms it will never divide E(x) so single bit errors are detected.