Scribd
Upload
11 views2 pages

Hamming Code Detailed Example-1

Hamming Code is an error-detection and correction technique used in networking to identify and fix single-bit errors. The document provides a detailed example of encoding a 7-bit data sequence using Hamming Code, calculating redundant bits, and demonstrating error detection and correction. The final corrected code is shown to match the original transmitted code after simulating an error.

Uploaded by

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

Hamming Code Detailed Example-1

Hamming Code is an error-detection and correction technique used in networking to identify and fix single-bit errors. The document provides a detailed example of encoding a 7-bit data sequence using Hamming Code, calculating redundant bits, and demonstrating error detection and correction. The final corrected code is shown to match the original transmitted code after simulating an error.

Uploaded by

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

Hamming Code in Networking – Detailed Explanation with Examples

Hamming Code is an error-detection and error-correction technique used in networking to detect and correct single

Example 3: 7-bit Data – 1101101

Step 1: Number of Redundant Bits


To satisfy 2^r >= m + r + 1, where m = 7,
We find r = 4 (as 2^4 = 16 >= 7 + 4 + 1 = 12)

Step 2: Bit Positions


Positions 1, 2, 4, 8 are for parity (P1, P2, P4, P8)
Others are data bits:
Position: 1 2 3 4 5 6 7 8 9 10 11
Type: P1 P2 D1 P4 D2 D3 D4 P8 D5 D6 D7
Data Values: 1 1 0 1 1 0 1

Step 3: Parity Bits (Even Parity)


P1: checks 1,3,5,7,9,11 => bits: 1,1,1,1,1 => Odd => P1 = 1
P2: checks 2,3,6,7,10,11 => bits: 1,0,1,0,1 => Odd => P2 = 1
P4: checks 4,5,6,7 => bits: 1,0,1 => Even => P4 = 0
P8: checks 8,9,10,11 => bits: 0,0,1 => Even => P8 = 0

Final Hamming Code: 1 1 1 0 1 0 1 0 1 0 1

Transmitted Code: 11101010101

Step 5: Error Simulation


Assume bit at position 6 is flipped → Received: 11101110101

Step 6: Error Detection


Check parities:
P1: OK
P2: Error
P4: Error
P8: OK

Binary of error position: 0110 (P8P4P2P1) = 6

Step 7: Error Correction


Flip bit at position 6 from 1 to 0

Corrected Code: 11101010101

Conclusion:
- Data: 1101101
- Encoded: 11101010101
- Received with error: 11101110101
- Error Detected at position 6
- Corrected Code: 11101010101

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy