Block Codes and Finite Fields MCQ’s

Electronics & Communication Engineering Wireless & Mobile Communications

This set of Wireless & Mobile Communications Multiple Choice Questions & Answers (MCQs) focuses on “Block Codes and Finite Fields”.

1. How many redundant bits are added in block codes for k information bits and n code bits?
a) n+k
b) n-k
c) k2
d) n2

2. For (n,k) block codes, rate of the code is defined as __________
a) n2/k
b) k2/n
c) n/k
d) k/n

3. In block codes, parity bits are ___________ to block of messages.
a) Added
b) Subtracted
c) Multiplied
d) Divided

4. The ability of the block code to correct errors is a function of __________
a) Number of parity bits
b) Number of information bits
c) Number of code bits
d) Code distance

5. Which of the following is not a property of block code?
a) Linearity
b) Systematic
c) Cyclic
d) Non linearity

6. CDPD stands for ___________
a) Cellular Digital Packet Data
b) Cellular Decoded Packet Data
c) Cellular Demodulated Packet Data
d) Cellular Decoded Plane Data

7. The weight of code is given by number of _______
a) Non-zero elements in the codeword
b) Zero elements in the codeword
c) Total elements in the codeword
d) Elements in parity bits

8. In systematic codes, parity bits are appended at the __________
a) Beginning
b) End
c) End
d) Odd places

9. Which of the following code is a class of non-binary BCH?
a) Hamming code
b) Hadamard code
c) Golay code
d) Reed Solomon codes

10. Which of the following is not an example of block code?
a) Hamming code
b) Cyclic code
c) Convolution code
d) BCH codes

11. Which of the following linear codes achieve largest possible minimum distance?
a) Hamming code
b) Hadamard code
c) Golay code
d) Reed Solomon codes

Leave a Reply

Your email address will not be published. Required fields are marked *