Digital Communication Questions and Answers
Q1.
The minimum distance for Reed Solomon code is given by
Answer :
n-k+1
Q2.
The measure of the amount of redundancy is given by
Answer :
Code rate
Q3.
How many number of transitions can be made at each bit time?
Answer :
Two
Q4.
For a binary code, the maximum number of possible sequence made up of L branch words is
Answer :
2L
Q5.
Gaussian channel is a hard decision channel.
Answer :
False
Q6.
In the dividing circuit, the parity polynomial is obtained by the
Answer :
Remainder
Q7.
The rate of a block code is the ration of
Answer :
Message length to block length
Q8.
In a standard matrix set code-word there are _______ cosset.
Answer :
2n-k
Q9.
Code strength is characterized by its
Answer :
Minimum distance
Q10.
For better efficiency and simplicity, n should be
Answer :
Minimum
🎕🎕🎕
🎕🎕🎕

0 Comments