Question
a.
Hamming code
b.
Hadamard code
c.
Golay code
d.
Reed Solomon codes
Posted under Wireless and Mobile Communications
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following linear codes achieve largest possible minimum distance?
Similar Questions
Discover Related MCQs
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
Q. In Viterbi’s algorithm, the selected paths are regarded as __________
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Wireless and Mobile Communications? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
