Consider an information source with entropy rate H. By the source coding theorem, it is possible to design a source code with rate R which reconstructs the source sequence X =(X1,X2, ··· ,Xn) with an arbitrarily small probability of error provided R>H and the block length n is sufficiently large.Howev