08 - W04L02 - Error Detection
08 - W04L02 - Error Detection
Computer Networks
Data Link Layer, Error Detection
If the bandwidth of a channel is 1Gbps then for how much duration the error should last?
Redundancy
To detect or correct errors, we need to send extra
(redundant) bits with data.
Detection versus Correction
In error detection, looking only to see if any error has
occurred. Simple yes or no answer.
In error correction, need to know the exact number of
bits that are corrupted and more importantly their
location in the message
Coding (block/convolution)
Redundancy is achieved through various coding
schemes. The sender adds redundant bits through a
process that receiver checks the relationships between
the two sets of bits to detect errors.
BLOCK CODING
1. Comparing the received codeword with the first codeword in the table
(01001 versus 00000), the receiver decides that the first codeword is not the
one that was sent because there are two different bits.
2. By the same reasoning, the original codeword cannot be the third or fourth
one in the table.
3. The original codeword must be the second one in the table because this is
the only one that differs from the received codeword by 1 bit. The receiver
replaces 01001 with 01011 and consults the table to find the dataword 01.
Figure XORing of two single bits or two words
Hamming Distance
The Hamming distance between two words
(of the same size) is the number of
differences between the corresponding bits.
Represented as d (x, y) for two words x and y
Found by applying XOR operation on the two
words and counting number of 1s in the
result
Example
Solution
We first find all the Hamming distances.