Definition for: hamming distance
Alphabetic selection:
Definition:
In general, the hamming distance between two strings of equal length measures the number of errors that transformed one string into the other. CAN provides a hamming distance of 6 (theoretical value for CAN networks). This indicates that five randomly distributed bit failures can be detected. In addition burst errors of up to 15 bit can be detected. CAN provides no bit correction mechanisms.
Data Job S.r.l. is the Italian sales representative of the KVASER products
We are available for any information about the hardware and software products.
Contact us