hamming code海明码学习笔记（汉明码海明码学习笔记）.docVIP

hamming code海明码学习笔记（汉明码海明码学习笔记） Hamming Code study notes.Txt Hamming code when you were born, you were crying and everyone around you was smiling; when you are passing away, youre smiling but lookers on are crying! Love someone an hour to take only a day to love someone, but it takes a lifetime to forget someone is a kind of Extended Hamming code parity. It uses a number of parity check codes, the parity bit in each of the different information data bits parity, through the reasonable arrangement of each parity check bit combination of the original data, can achieve the purpose of correcting errors found wrong. Assuming the data with an M, how to set the parity bit length of K can meet the requirements of the correct a mistake? We are here to do a simple derivation. K checksum bits can have a value. Obviously, one of the values that the data is correct, and the remaining 1 - value means that the errors in the data, if can meet: - 1m + K (M + K for the total length of the encoding), in theory, a K check code can determine which one (including the information code problems and check code). 1. encoding steps (1) according to the information bits, parity check digit, 2R = k+r+1, wherein K is r information bits, parity check digit. For the minimum r inequality is the check digit. (2) computer check formula. Table 1-3 parity formula table ... 12111098765 4321 digit ... I8 I7 I6 I5 I4 I3 I2 I1 information ... R3 R2 R1 R0 bits Table 1-3 can actually as a formula to apply, if there are already encoding data 110010010111. We only need to fill to check formula for these data, you can get information bits and parity bit. Filling method is that, first look at the low data (i.e., first right), the lowest is 1, 1 is filled in the formula table R0 position, then remove the data in time low data (i.e., second right), put it to fill the position of R1, the third digits to the right of filling I1 the. By analogy, we can get the table 1-4. Table 1-4 parity formula instance table ... 12