海明距离和CRC

Question

How to find the Hamming distance of a code generated by a certain CRC?

Assume that I have a generating polynomial of order, say, 4 and 11 bits of data.

How to compute the HD basing only on these information?

Answer 1

You should be able to pad your results with zeros making both values 11bits long. Computing an XOR on the two bit strings and counting the ones should yield the hamming distance for your data set.

Hope this helps...