- 600 Downloads
Let H be the entropy rate of an information source. By the source coding theorem, it is possible to design a source code with rate R which reconstructs the source sequence X = (X1, X2, …, X n ) with an arbitrarily small probability of error provided R > H and the block length n is sufficiently large. However, there are situations in which we want to convey an information source by a source code with rate less than H. Then we are motivated to ask: what is the best we can do when R < H?
KeywordsSource Code Information Source Distortion Measure Entropy Rate Source Sequence
Unable to display preview. Download preview PDF.