# 10.8 SUMMARY o Data can be corrupted during transmission. Some applications require that errors be detected and corrected.

o In a single-bit error, only one bit in the data unit has changed. A burst error means that two or more bits in the data unit have changed. o To detect or correct errors, we need to send extra (redundant) bits with data. o There are two main methods of error correction: forward error correction and correction by retransmission. o We can divide coding schemes into two broad categories: block coding and convolution coding. o In coding, we need to use modulo-2 arithmetic. Operations in this arithmetic are very simple; addition and subtraction give the same results. we use the XOR (exclusive OR) operation for both addition and subtraction. o In block coding, we divide our message into blocks, each of k bits, called datawords. We add r redundant bits to each block to make the length n ::: k + r. The resulting n-bit blocks are called codewords. o In block coding, errors be detected by using the following two conditions: a. The receiver has (or can find) a list of valid codewords. b. The original codeword has changed to an invalid one. o The Hamming distance between two words is the number of differences between corresponding bits. The minimum Hamming distance is the smallest Hamming distance between all possible pairs in a set of words. o To guarantee the detection of up to s errors in all cases, the minimum Hamming distance in a block code must be dmin ::: s + 1. To guarantee correction of up to t errors in

In this arithmetic.com SECTION 10. What is the Hamming distance? What is the minimum Hamming distance? 6. o A simple parity-check code is a single-bit error-detecting code in which n ::: k + 1 with dmin ::: 2. A simple parity-check code can detect an odd number of errors.9 PRACTICE SET 303 o A category of cyclic codes called the cyclic redundancy check (CRC) is used in networks such as LANs and WANs. the result is another codeword.1. 10.9 PRACTICE SET Review Questions 1.blogspot. o A pattern of Os and Is can be represented as a polynomial with coefficients of 0 and 1. the Internet has been using a I6-bit checksum. Discuss the concept of redundancy in error detection and correction. 3. the exclusive OR (XOR) of any two valid codewords creates another valid codeword. o All Hamming codes discussed in this book have dmin ::: 3. theSumit67. o Cyclic codes are special linear block codes with one extra property. which uses one's complement arithmetic. o In a linear block code. o Traditionally. Distinguish between forward error correction versus error correction by retransmission. The relationship between m and n in these codes is n::: 2m . we can represent unsigned numbers between oand 2n -1 using only n bits. if a codeword is cyclically shifted (rotated). the minimum Hamming distance in a block code must be dmin ::: 2t + 1. 4. What is the definition of a linear block code? What is the definition of a cyclic code? 5. How is the simple parity check related to the two-dimensional parity . In a cyclic code.all cases. How does a single-bit error differ from a burst error? 2.