Skip to content
GATEiit

GATE CSE 2021 Set 1 Q39: Missing data and check bits in a 12-bit Hamming codeword

Question

Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1d_8 d_7 d_6 d_5 c_8 d_4 d_3 d_2 c_4 d_1 c_2 c_1, where the data bits and the check bits are given in the following tables:

Which one of the following choices gives the correct values of xx and yy?

Data bits
d8d_8d7d_7d6d_6d5d_5d4d_4d3d_3d2d_2d1d_1
110xx0101
Check bits
c8c_8c4c_4c2c_2c1c_1
yy010

Try it: multiple choice: exactly one correct option

Select one option
Wrong answer costs 2/3 mark in GATE.
Show answer and explanation

Answer: A (official GATE 2021 final answer key)

Concept used: In a Hamming code the check bit at position 2k2^k makes the parity even over all positions whose binary index has bit kk set.

First step: Number the positions 12 down to 1; c1c_1 covers positions 1, 3, 5, 7, 9, 11, which include d5=xd_5 = x at position 9.

Full step-by-step solution

Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.

Share this question

WhatsAppDownload image

Source: official GATE 2021 Set 1 CS question paper and final answer key, organised by IIT Bombay. Question paper · Answer key