Hamming parity law is a more important points soft test learning.
Let's explain in detail the Hamming check code.
First of all, the first step, a clear definition.
Hamming code:
Using a parity check method for error detection and correction.
So you want to reach the error detection and correction effect, it will be carried out by adding capacity, which is to be tested by the distance XL
Yards from :
Refers to a coding system has at least the number of different bits between any two valid code. (Meaning that at least another legal code to be changed in order to change the number of bits to be)
❤ For chestnuts
A length of the binary coded, if A = 1, B = 0, so that the minimum code between A, B is from 1
Binary coded two lengths, if A = 11, B = 00, so that the minimum code between A, B is from 2
Three binary coded length, when A = 111, B = 000, so the minimum code between A, B is from 3
XL distance to error detection and correction
Chestnuts with the above example,
Because mentioned here use to test parity error correction, so we add parity check code knowledge points.
Hamming code configuration method is: k parity bits inserted at a specific location between the data bits, error detection and correction is achieved by expanding the code distance.
Note: this means is that
