Scribd
Upload
50 views50 pages

CH - 03 - 2 Error Det and Corr

The document discusses error detection and correction techniques used in computer networks such as parity checks, checksums, and Hamming codes. It provides examples of how vertical and longitudinal redundancy checks work to detect errors and describes cyclic redundancy checks which can detect and correct single bit errors using polynomial division. Common questions about IP addressing, subnetting, and calculating valid host ranges are also answered.

Uploaded by

scorpion
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
50 views50 pages

CH - 03 - 2 Error Det and Corr

The document discusses error detection and correction techniques used in computer networks such as parity checks, checksums, and Hamming codes. It provides examples of how vertical and longitudinal redundancy checks work to detect errors and describes cyclic redundancy checks which can detect and correct single bit errors using polynomial division. Common questions about IP addressing, subnetting, and calculating valid host ranges are also answered.

Uploaded by

scorpion
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 50

Computer Network

• Error Detection & Correction

• Hamming Code method (1-bit correction)

• IP Address /Class
• Sub netting with an Example
– Subnet
– Subnet mask
• Some Questions
Error Detection
and Correction

• Types of Errors
• Detection
• Correction
Single-bit error
Burst error
Question: If the Bandwidth of the channel is 1GBPS the for how
much duration the error should Last?
Answer:

9
1Gbps = 10 bits-------------- 1 secs
1 bit ------------------------------ ?

-> 1/10 9
= 1 ns
Question: If an error occurred up to 1/1000 sec duration in above
questions then how many bits corrupted?
Answer:

1/1000 * 10 9 6
= 10 bits are corrupted
Error detection
Error detection means to decide whether the
received data is correct or not without having a
copy of the original message.

Error detection uses the concept of redundancy,


which means adding extra bits for detecting
errors at the destination.
Redundancy
Four types of redundancy checks are used
in data communications
Vertical Redundancy Check
VRC/ Parity Check

VRC: 1; if odd number of 1’s


VRC: 0; if even number of 1’s
Vertical Redundancy Check
VRC/ Parity Check
Performance
It can detect single bit error

It can detect burst errors only if the total number


of errors is odd.
Longitudinal Redundancy Check
LRC
Longitudinal Redundancy Check
LRC
Longitudinal Redundancy Check
LRC
Longitudinal Redundancy Check
LRC
Performance
LRC increases the likelihood of detecting
burst errors.
If two bits in one data units are damaged
and two bits in exactly the same positions in
another data unit are also damaged, the
LRC checker will not detect an error.
VRC and LRC
Checksum
Checksum
Checksum
Checksum
Checksum
Checksum on Hex data
Cyclic Redundancy Check
CRC
Cyclic Redundancy Check
CRC
Cyclic Redundancy Check
CRC
Binary Division
Polynomial
Polynomial and Divisor
Figure Division in CRC encoder
Figure Division in the CRC decoder for two cases
Figure Division in the CRC decoder for two cases
CRC at sender side and generated codeword
Single-bit error correction
Single-bit error correction
Single-bit error correction
Single-bit error correction
To correct an error, the receiver reverses the value
of the altered bit. To do so, it must know which
bit is in error.
Number of redundancy bits needed
• Let data bits = m
• Redundancy bits = r
Total message sent = m+r
The value of r must satisfy the following relation:
2r ≥ m+r+1
Error Correction
Hamming Code
Hamming Code
Hamming Code
Example of Hamming Code
Single-bit error
Error
Detection
Checking for error:
Receiver does the step 3 operation stated above on codeword C. After this
operation, the bit combination represents a binary number which corresponding
to a decimal number. If the decimal number is 0 then there is no error. Otherwise,
if the decimal number is n then it is concluded that the n-th bit is error-bit.

Example:

                                                                                                                                                                               
• What is checksum? Calculate for given data
that the code is accepted or rejected?
• 466F, 726F, 757A, 616E
IP Address/Class ???
Q-What is the broadcast address of the network 172.31.180.128/25?

Q-What valid host range is the IP address 10.254.201.56/20 a part of?

Q-How many subnets and hosts per subnet can you get from the
network 172.28.0.0/23?

Q-What is the last valid host on the subnetwork 172.19.156.0/23?

Q-What valid host range is the IP address 192.168.206.28


 255.255.255.248 a part Of?
IP Address/Class ???
Q-What is the broadcast address of the network 172.31.180.128/25?
ANS: 172.31.180.255
Q-What valid host range is the IP address 10.254.201.56/20 a part of?
ANS: 10.254.192.1 to 10.254.207.254
Q-How many subnets and hosts per subnet can you get from the
network 172.28.0.0/23?
ANS: 128 subnets and 510 hosts
Q-What is the last valid host on the subnetwork 172.19.156.0/23?
ANS: 172.19.157.254
Q-What valid host range is the IP address 192.168.206.28
255.255.255.248 a part Of?

ANS: 192.168.206.25 through to 192.168.206.30

You might also like