Consider the binary code that consists of only four valid codewords as given…

GATE · 2017 · CS · Set 2 · Computer Science & IT

Consider the binary code that consists of only four valid codewords as given below:

00000,01011,10101,11110

Let the minimum Hamming distance of the code $p$ and the maximum number of erroneous bits that can be corrected by the code be $q$ . Then the values 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$

Attempted by 453 students.

Explore the full course: Gate Guidance By Sanchit Sir