Coding for Discrete Memoryless Sources
Part of the International Centre for Mechanical Sciences book series (CISM, volume 110)
We shall consider a Discrete Memoryless Source (DMS), which can be represented by a finite scheme:with the usual conditionsThe DMS is supposed to emit one letter each unit of time, choosing it from its alphabetaccording to the probability distribution (p.d.)
KeywordsTypical Sequence Arbitrary Positive Number Source Sequence Codeword Length Encode Rate
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Wien 1971