Skip to main content

The Discrete Memoryless Channel

  • Conference paper
Coding Theorems of Information Theory

Part of the book series: Ergebnisse der Mathematik und Ihrer Grenzgebiete ((MATHE2,volume 31))

  • 140 Accesses

Abstract

Let w (j | i), i, j = 1, ... , a, be nonnegative numbers such that

$$ w\left( {\left. \cdot \right|i} \right) = \left( {w\left( {\left. 1 \right|i} \right),...,w\left( {\left. a \right|i} \right)} \right) $$

is a probability a-vector. The function w (· | ·) will now play the role of a “channel probability function” (c.p.f.).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1961 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolfowitz, J. (1961). The Discrete Memoryless Channel. In: Coding Theorems of Information Theory. Ergebnisse der Mathematik und Ihrer Grenzgebiete, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01510-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-01510-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-01512-4

  • Online ISBN: 978-3-662-01510-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics