Digital Communication Questions and Answers
Q1.
Reed Solomon codes are
Answer :
Non binary & Cyclic
Q2.
If the inversion was performed correctly, then the multiplication of the original matrix with the inverted matrix should yield identity matrix. This is known as
Answer :
Safety theorem
Q3.
Finite state machines have
Answer :
Past memories also
Q4.
In maximum likelihood detector the error probability is
Answer :
Minimum
Q5.
Binary symmetric channel is hard decision channel.
Answer :
True
Q6.
The feedback shift register circuit is called as
Answer :
Dividing circuit
Q7.
Block length is the _______ in the code word.
Answer :
Number of elements
Q8.
To avoid corruption during transmission, the code-word should be
Answer :
Far apart
Q9.
Hamming distance can be given by the number of elements in which
Answer :
They differ
Q10.
The number of errors that can be corrected without erasure information is
Answer :
(Dmin – 1)/2
🎕🎕🎕
🎕🎕🎕
0 Comments