CRC polynomial and Parity Error detection
This is a general rule , in youre case  k = 6 


Short Burst Errors

(Length b ≤ k, number of redundant bits)


-->All errors up to length k are detected


Long Burst Errors (Length b = k+1)


Undetectable only if burst error is the same as g(x)

g(x) = x^k+ … + 1       k-1 bits between xk and x0 
e(x) = x^k + … + 1      must match


Probability of not detecting the error is 2^(-(k-1))


Longer Burst Errors (Length m > k+1)


Probability of not detecting the error is 2^(-k)