[amp_mcq option1=”One” option2=”Two” option3=”Four” option4=”Eight” correct=”option1″]
The correct answer is A. One.
In Repetition Code, each data bit is repeated n times, where n is the number of parity bits. This means that there is one information bit for every n parity bits.
For example, if we have a 3-bit data word 101, we would encode it as 11110101. In this case, there is one information bit (1) and three parity bits (111).
Repetition Code is a simple and effective error-correcting code. It can correct up to one bit error per codeword. However, it cannot correct multiple bit errors.
Here is a brief explanation of each option:
- Option A: One. This is the correct answer. In Repetition Code, each data bit is repeated n times, where n is the number of parity bits. This means that there is one information bit for every n parity bits.
- Option B: Two. This is incorrect. There is only one information bit per codeword in Repetition Code.
- Option C: Four. This is incorrect. There is only one information bit per codeword in Repetition Code.
- Option D: Eight. This is incorrect. There is only one information bit per codeword in Repetition Code.