Scribd
Upload
21 views5 pages

Saideepmukhopadhyay 11200222017 It

The document is a technical report on computer networks submitted by Saideep Mukhopadhyay, detailing Hamming code calculations and binary code analysis. It includes explanations for determining values of x and y in a Hamming codeword, as well as calculating the minimum Hamming distance and maximum erroneous bits for a given binary code. The final answers conclude that x=0, y=0, p=3, and q=1.

Uploaded by

fast forward
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
21 views5 pages

Saideepmukhopadhyay 11200222017 It

The document is a technical report on computer networks submitted by Saideep Mukhopadhyay, detailing Hamming code calculations and binary code analysis. It includes explanations for determining values of x and y in a Hamming codeword, as well as calculating the minimum Hamming distance and maximum erroneous bits for a given binary code. The final answers conclude that x=0, y=0, p=3, and q=1.

Uploaded by

fast forward
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/ 5

Technical Report writing on

Computer Networks

Submitted by
Name: Saideep Mukhopadhyay
Department: IT
Semester: 6th
Roll no:11200222017

DEPARTMENT OF INFORMATION TECHNOLOGY

GOVERNMENT COLLEGE OF ENGINEERING AND LEATHER

TECHNOLOGY
Write an explanation report for the following questions:- CA2

1. Assume that 12 bit hamming codeword consist of 8 bit data and


4 check bits is d8d7d6d5c4d4d3d2c3d1c2c1 ,where the data bits
and the check bits are given in the following tables: [GATE
2021 ]

Which one of the following choices gives the correct values of x and y ?
Answer:
To determine the values of x and y in the given 12-bit Hamming codeword, we need to check the
parity bit calculations. The Hamming code follows an error-detection and correction scheme
where check bits are placed at positions that are powers of 2 (i.e., c1, c2, c4, c8).
Given Data:
 Data Bits: d8=1, d7=1, d6=0, d5=x, d4=0, d3=1, d2=0, d1=1
 Check Bits: c8=y, c4=0, c2=1, c1=0
Hamming Code positions:

Explanation of the answer:

The correct values of x=0 and y=0


Answer the following for PCA1..
2. Consider a binary code that consists only four valid
codewords as given below. 00000, 01011, 10101, 11110 Let
minimum Hamming distance of code be p and maximum
number of erroneous bits that can be corrected by the code
be q. The value of p and q are:
a)p = 3 and q = 1 b)p = 3 and q = 2 c)p = 4 and q = 1 d)p = 4
and q = 2
Explain your answer.
Ans:-
Question Overview:- Given a binary code with four
codewords:-
00000
01011
10101
11110
We need to determine:
1. The minimum Hamming distance (p) of the code.
2. The maximum number of erroneous bits (q) that can be
corrected by the code.
3. The options provided are:
a)p = 3 and q = 1
b)p = 3 and q = 2
c)p = 4 and q = 1
d)p = 4 and q = 2
Key Concepts
1. Hamming Distance:
It is a matrix for comparing two binary strings. The Hamming
distance between two codewords is the number of bit positions
in which they differ.
For example : The Hamming distance
between 00000 and 01011 is 3, as they differ in the 2nd, 4th, and
5th bits.
2. Minimum Hamming Distance (p):
The minimum Hamming distance of a code is the smallest
Hamming distance between any two valid codewords. It
determines the error-detection and correction capabilities of the
code.
3. Maximum Number of Erroneous Bits (q):
The maximum number of erroneous bits that can be corrected by
a code is given by:
𝑝−1
q=⌊ ⌋
2

Here, ⌊⋅⌋ denotes the floor function.


Step-by-Step Solution
1. Calculate Hamming Distances Between All Codewords
Compute the Hamming distance between each pair of
codewords:
o 00000 and 01011: 3
o 00000 and 10101: 3
o 00000 and 11110: 4
o 01011 and 10101: 4
o 01011 and 11110: 3
o 10101 and 11110: 3
2. Determine the Minimum Hamming Distance (p)
From the computed distances, the smallest Hamming distance
is 3.
Therefore, p=3.
3. Calculate the Maximum Number of Erroneous Bits (q)
Using the formula:
𝑝−1 3−1
q=⌊ ⌋=⌊ ⌋=⌊1⌋=1
2 2

Therefore, q=1.
Final Answer
The correct values are:
 p=3
 q=1
Thus, the correct option is:
a) p=3 and q=1
Explanation of the Answer
 The minimum Hamming distance (p) is 3, as the smallest
distance between any two codewords is 3.
 The maximum number of erroneous bits (q) that can be
3−1
corrected is 1, as q=⌊ ⌋=1
2

This means the code can detect up to 2 errors and correct up to 1


error.

You might also like