Let X be an ensemble with AX = {0, 1} and PX = {0.995, 0.005}. Consider source coding using the block coding of X100 where every x ∈ X100 containing 3 or fewer 1s is assigned a distinct codeword, while the other xs are ignored.
(a) If the assigned codewords are all of the same length, find the minimum length required to provide the above set with distinct codewords.
(b) Calculate the probability of getting an x that will be ignored.