Advertisement

Coding for Discrete Memoryless Sources

  • Giuseppe Longo
Part of the International Centre for Mechanical Sciences book series (CISM, volume 110)

Abstract

We shall consider a Discrete Memoryless Source (DMS), which can be represented by a finite scheme:
(2.1)
with the usual conditions
(2.2)
The DMS is supposed to emit one letter each unit of time, choosing it from its alphabet
(2.3)
according to the probability distribution (p.d.)
(2.4)

Keywords

Typical 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 1971

Authors and Affiliations

  • Giuseppe Longo
    • 1
  1. 1.University of TriesteItaly

Personalised recommendations