Let X be the ensemble of letters from a DMS with finite entropy H(X). Blocks of J symbols from the source are encoded into code words of length N from a binary alphabet. For any ‘ℇ’ >0 , the probability of error ‘P_e’ of a block coding failure can be made arbitrarily small if