Help authour, Buy PDF Ebook >>>Click Here<<<
Hamming Code Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Question 1 |
The most common hamming codes are a generalized version of?
Hamming(7, 4) code | |
Hamming(8, 4) code | |
Hamming(6, 3) code | |
Hamming(5, 7) code |
Question 1 Explanation:
The most common hamming codes generalize to form hamming(7, 4) code. It encodes four bits of data into seven bits by adding three parity bits.
Question 2 |
What is the minimal Hamming distance between any two correct codewords?
1 | |
2 | |
3 | |
4 |
Question 2 Explanation:
Since we use a generalized version of Hamming(7, 4) code, the minimal hamming distance is 3. It cannot correct burst errors.
Question 3 |
Why do we require hamming codes?
Error correction | |
Encryption only | |
Decryption | |
Bit stuffing |
Question 3 Explanation:
Hamming codes are used for the purpose of error detection and correction. It is also used for channel encoding and decoding. They are linear-error correcting codes.
Question 4 |
Hamming codes can be used for both single-bit error and burst error detection and correction.
True | |
False |
Question 4 Explanation:
Hamming bits are suitable only for single-bit error detection and correction and two bit error detection. It is very unlikely to detect burst errors.
Question 5 |
Who invented Hamming codes?
Richard Hamming | |
Ross Hamming | |
Shannon | |
Huffman |
Question 5 Explanation:
Richard W. Hamming invented hamming codes in Bell Telephone Laboratory to minimize the errors in punched card readers. Huffman invented huffman codes. Shannon invented Shannon-Fanno codes.
There are 5 questions to complete.