Q. How many redundant bits are added in block codes for k information bits and n code bits?

View solution

Q. For (n,k) block codes, rate of the code is defined as __________

View solution

Q. The ability of the block code to correct errors is a function of __________

View solution

Q. The weight of code is given by number of _______

View solution

Q. Which of the following is not a property of block code?

View solution

Q. In systematic codes, parity bits are appended at the __________

View solution

Q. Which of the following is not an example of block code?

View solution

Q. Which of the following code is a class of non-binary BCH?

View solution

Q. Which of the following linear codes achieve largest possible minimum distance?

View solution

Q. CDPD stands for ___________

View solution

Q. Block codes can achieve a larger coding gain than convolution coding.

View solution

Q. Which of the following indicates the number of input bits that the current output is dependent upon?

View solution

Q. Which of the following is not a way to represent convolution code?

View solution

Q. Which of the following is not an algorithm for decoding convolution codes?

View solution

Q. Viterbi algorithm performs ____________ decoding of convolutional codes.

View solution

Q. Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path.

View solution

Q. Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm?

View solution

Q. In comparison to stack algorithm, Fano’s algorithm is simpler.

View solution

Q. Which of the following is not an error correction and detection code?

View solution

Q. Which decoding method involves the evaluation by means of Fano’s algorithm?

View solution