Let us add more redundant bits to Example 6.2 to see if the receiver can correct an error without knowing what was actually sent. We add 3 redundant bits to the 2-bit dataword to make 5-bit codewords. Table 6.2 shows the datawords and codewords. Assume the dataword is 01. The sender creates the codeword 0611. The codeword is corrupted during transmission, and 0601 is received. First, the receiver finds that the received codeword is not in the table. This means an error has occurred. The receiver, assuming that there is only 1 bit corrupted, uses the following strategy to guess the correct dataword.
đang được dịch, vui lòng đợi..
