GATEverse Practice, past papers & mock tests
GATE 2017 · CS2 - Afternoon
Computer NetworksLANeasyMCQ2 marks
Consider a binary code that consists of only four valid codewords: 00000, 01011, 10101, 11110. Let the minimum Hamming distance of the code be 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
Save your progress

Related Computer Networks PYQs