A binary symmetric channel with p as transition probability, uses repetition code 'n' times, with n = 2m + 1 being an odd integer. In a block of n bits, if the number of zeros exceed number of ones, decoder decodes it as "0" otherwise as "1". An error occurs when m + 1 or more transmission out of 3 are incorrect, what is the probability of error?
A. 3p2(1 - p) + p3
B. 5p2(1 - p) + $$\frac{1}{3}$$p3
C. p3(1 - p) + p2
D. p3(1 - p) + p2
Answer: Option A
This Question Belongs to Electronics And Communications Engineering >> Information Theory And Coding
Related Questions on Information Theory and Coding
A. The same as FDM
B. The same as TDM
C. A combination of FDM and TDM
D. Quite different from FDM and TDM
A. C2 ≈ 2C1
B. C2 ≈ C1 + B
C. C2 ≈ C1 + 2B
D. C2 ≈ C1 + 0.3B
A. 1 and 2
B. 2 and 3
C. 1 and 3
D. None of the above
Which decoding method involves the evaluation by means of Fano Algorithm?
A. Maximum Likelihood Decoding
B. Sequential Decoding
C. Both A and B
D. None of the above
Join The Discussion