Paper 2, Section I, I

Coding and Cryptography | Part II, 2020

(a) Define the information capacity of a discrete memoryless channel (DMC).

(b) Consider a DMC where there are two input symbols, AA and BB, and three output symbols, A,BA, B and ⋆\star. Suppose each input symbol is left intact with probability 1/21 / 2, and transformed into a ⋆\star with probability 1/21 / 2.

(i) Write down the channel matrix, and calculate the information capacity.

(ii) Now suppose the output is further processed by someone who cannot distinguish between AA and ⋆\star, so that the channel matrix becomes

(101/21/2)\left(\begin{array}{cc} 1 & 0 \\ 1 / 2 & 1 / 2 \end{array}\right)

Calculate the new information capacity.

Typos? Please submit corrections to this page on GitHub.