Skip to main content

The Semi-Continuous Memoryless Channel

  • Conference paper
Coding Theorems of Information Theory

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

  • 405 Accesses

Abstract

The semi-continuous memoryless channel (s.c.m.c.) differs from the d.m.c. only in that the output alphabet may be infinite. (The name “semi-continuous” is of engineering origin.) Without any essential loss of generality we take the space of the output alphabet to be the real line. This is done only to avoid ponderousness, and the extension to the case where the space of the output alphabet is any space on which is defined a σ-algebra of sets is trivial.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolfowitz, J. (1978). The Semi-Continuous 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-642-66822-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-66822-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-66824-1

  • Online ISBN: 978-3-642-66822-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics