The Discrete Finite-Memory Channel

  • J. Wolfowitz
Conference paper
Part of the Ergebnisse der Mathematik und Ihrer Grenzgebiete book series (MATHE2, volume 31)


The discrete channel. We begin this chapter with a description of the general discrete channel. The term "“discrete” means that both input and output alphabets have a finite number of elements. For the sake of simplicity and without essential loss of generality we take both these alphabets to be {1, . . . , a}. This will lighten somewhat the heavy burden of definitions and notation. The application of the theorems to cases where the alphabets have different numbers of elements will be obvious and will be made freely. (See also Chapter 3, Remark 10.) It is hoped that this manner of proceeding will make things less ponderous. Unless the contrary is explicitly stated the channels involved will have a single c.p.f., unlike, for example, the compound channels of Chapter 4.


Marginal Distribution Conditional Entropy Ergodic Capacity Receive Message Compound Channel 
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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, Berlin · Göttingen · Heidelberg 1964

Authors and Affiliations

  • J. Wolfowitz
    • 1
  1. 1.Cornell UniversityUSA

Personalised recommendations